Abstract
The accepted method of determining name gender is to use a probabilistic model based on observations, which fails to classify unseen names. We attempt to solve this by utilising a hyphenation-driven method which is also more space efficient.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Patman, F., Thompson, P.: In: Chen, H., et al. (eds.) ISI 2003. LNCS, vol. 2665, pp. 27–38. Springer, Heidelberg (2003)
Bilenko, M., Mooney, R.J.: Learning to combine trained distance metrics for duplicate detection in databases. Tech. Rep. Technical Report AI 02-296, Artificial Intelligence Laboratory, University of Texas at Austin, Austin, TX (February 2002)
Liang, F.M.: Word Hy-phen-a-tion by Com-put-er. PhD thesis, Department of Computer Science, Stanford University, Stanford, CA 94305 (August 1983)
Tolpin, D.: TeX Hyphenator in Java (2003), http://www.davidashen.net/
Department, F.H.: The GEDCOM Standard Release 5.5. The Church of Jesus Christ of Latterday Saints (January 1996), http://www.gendex.com/gedcom55/55gctoc.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Warren, R.H., Leurer, C. (2004). Determining the Gender of the Unseen Name through Hyphenation. In: Chen, H., Moore, R., Zeng, D.D., Leavitt, J. (eds) Intelligence and Security Informatics. ISI 2004. Lecture Notes in Computer Science, vol 3073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25952-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-25952-7_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22125-8
Online ISBN: 978-3-540-25952-7
eBook Packages: Springer Book Archive