Data processing: speech signal processing – linguistics – language – Linguistics
Reexamination Certificate
2006-03-07
2006-03-07
Young, W. R. (Department: 2655)
Data processing: speech signal processing, linguistics, language
Linguistics
C704S009000
Reexamination Certificate
active
07010476
ABSTRACT:
A system constructs finite-state networks. The system initially compiles an intermediate finite-state network from a source file of regular expressions. The intermediate finite-state network includes a delimited subpath that defines a substring having the form of a regular expression. The system subsequently produces an output finite-state network in which the delimited subpath is replaced with an FSN compiled from the substring encoded by the delimited subpath.
REFERENCES:
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5625554 (1997-04-01), Cutting et al.
patent: 5642522 (1997-06-01), Zaenen
patent: 6023760 (2000-02-01), Karttunen
patent: 6032111 (2000-02-01), Mohri
patent: 6278973 (2001-08-01), Chung et al.
patent: WO 9901828 (1999-01-01), None
Roche, Emmanuel. “Factorization of Finite-State Transducers”, Mitsubishi Electric Research Laboratories, 1995.
Kempe, Andre. Karttunen, Lauri. “Parallel Replacement in Finite State Calculus”, Proceedings of the 16th International conference on Computational Linguistics, Coling 96, Copenhagen Denmark.
Karttunen, Lauri. “The Replace Operator”, Proceedings of the 33rd annual meeting on Association for Computational Linguistics table of contents, Cambridge, Massachusetts, pp.: 16-23, 1995 □□.
Beesley, K. Karttunen, L. “Finite-State Non-Concatenative Morphotactics” Proceedings of the 38th annual meeting of association for Computation Linguistics, 2000, pp. 191-198.
Karttunen, L. “Directed Replacement” Proceedings of the 34th annual meeting on association for computation linguistics, 1996, pp. 108-115.
Bouma, G. “A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion” ACM International Conference Proceedings Series, vol. 4, pp. 303-310, 2000.
Reape, M. Thompson, H. “Parallel Intersection and Serial Composition of Finite State Transducers” International Conference on Computational Linguistics, pp. 535-539, 1988.
Lauri Karttunen, Ronald M. Kaplan, and Annie Zaenen. “Two-level morphology with composition”, In COLING'92, pp. 141-148, Nantes, France, Aug. 23-28. 1992.
Lauri Karttunen. “Finite-state lexicon complier”. Technical Report ISTL-NLTT-1993-04-02, Xerox Palo Alto Research Center, Palo Alto, CA, Apr., 1993.
Lauri Karttunen. “Constructing lexical transducers”. In COLING'94, Kyoto, Japan. 1994.
Lauri Karttunen, Jean Pierre Chanod, Greg Grefenstette, and Anne Schiller. “Regular expressions for language engineering”. Natural Language Engineering 2 (4), 305-328. 1996.
Lauri Karttunen, Tamás Gaál, and André Kempe 1997. “Xerox Finite-State Tool”. Techical Report. Xerox Research Centre Europe, Grenoble. Meylan, France. Jun. 1997.
Laura Kataja and Kimmo Koskenniemi. “Finite-state descripton of Semitic morphology: A case study of Ancient Akkadian”. In COLING'88, pp. 313-315. 1988.
Martin Kay. “Nonconcatenative finite-state morphology”. In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics, pp. 2-10. 1987.
George Anton Kiraz and Edmund Grimley-Evans. “Multi-tape automata for speech and language systems: A Prolog implementation”. In Jean-Marc Champarnaud, Denis Maurel, and Djelloul Ziadi, editors, Automata Implementation; vol. 1660 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany. 1999.
George Anton Kiraz. “Multi-tape two-level morphology: a case study in Semitic non-linear morphology”. In COLING'94, vol. 1, pp. 180-186. 1994.
George Anton Kiraz. “Semhe: A generalised two-level system”. In Proceedings of the 34th Annual Meeting of the Association of Computational Linguistics, Santa Cruz, CA. 1996.
George Anton Kiraz. “Multi-tiered non-liner morphology: A case study on Syriac and Aribic”. Computational Linguistics, vol. 26, No. 1. 2000.
Kimmo Koskenniemi. “Two-level morphology: A general computational model for word-form recognition and production”. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki. 1983. (See in particular pp. 27-28.).
Alon Lavie, Alon Itai, Uzzi Ornan, and Mori Rimon. “On the applicability of two level morphology to the infection of Hebrew verbs”. In Proceedings of ALLC III, pp. 246-260. 1988. (See in particular bottom of p. 248.).
John J. McCarthy and Alan Prince. “Faithfulness and reduplicative identity”. Occasional papers in Linguistics 18, University of Massachusetts, Amherst, MA. ROA-60. 1995.
John J. McCarthy. “A prosodic theory of nonconcatenative morphology”. Linguistic Inquiry, 12(3):373-418. 1981.
Richard Sproat. “Morphology and Computation.”. Section 2.4.4 Nonconcative morphology, MIT Press, Cambridge, MA. pp. 159-170. 1992.
Evan L. Antworth. “PC-KIMMO: a two-level processor for morphological analysis”. Section 6.4 “Nonconcatenative processes” to section 6.4.7 “Reduptication with coalescence”, in No. 16 of Occasional publications in academic computing. Summer Institute of Linguistics, Dallas. pp. 151-161. 1990, no date.
Kenneth R. Beesley, Tim Buckwalter, and Stuart N. Newton. “Two-level finite-state analysis of Arabic morphology”. In Proceedings of the Seminar on Bilingual Computing in Arabic and English, Cambridge, England, Sep. 6-7. No pagination. 1989, no date.
Kenneth R. Beesley. “Finite-state description of Arabic morphology”. In Proceedings of the Second Cambridge Conference on Bilingual Computing in Arabic and English, Sep. 5-7. No pagination. 1990, no date.
Kenneth R. Beesley. “Computer analysis of Arabic morphology: A two-level approach with detours”. In Bernard Comrie and Mushira Eid, editors, Perspectives on Arabic Linguistics III: Papers from the Third Annual Symposium on Arabic Linguistics, pp. 155-172. John Benjamins, Amsterdam. 1991, year only.
Kenneth R. Beesley. “Arabic finite-state morphological analysis and generation”. In COLING'96, vol. 1, pp. 89-94, Copenhagen, Aug. 5-9. Center for Sprogteknologi. The 16th International Conference on Computational Linguistics. 1996, year only.
Kenneth R. Beesley. “Arabic morphological analysis on the Internet”. In ICEMCO-98, Cambridge, Apr. 17-18. Centre for Middle Eastern Studies. Proceedings of the 6th International Conference and Exhibition on Multi-lingual Computing. Paper No. 3.1.1; no pagination. 1998, year only.
Kenneth R. Beesley. “Arabic morphology using only finite-state operations”. In Michael Rosner, editor, Computational Approaches to Semitic Languages: Proceedings of the Work-shop, pp. 50-57, Montréal, Québec, Aug. 16. Université de Montréal. 1998, year only.
Kenneth R. Beesley. “Arabic stem morphotactics via finite-state intersection”. Paper presented at the 12th Symposium on Arabic Linguistics, Arabic Linguistic Society, Mar. 6-7, 1998, Champaign, IL.
Kenneth R. Beesley. “Consonant Spreading in Arabic Stems”, In COLING-ACL'98, vol. 1, pp. 117-123. Aug. 1998, no date.
Kenneth R. Beesley and Lauri Karttunen. “Finite-State Non-Concatenative Morphotactics”. SIGPHON-2000, Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology, pp. 1-12, Aug. 6, 2000, Luxembourg.
Beesley Kenneth R
Karttunen Lauri J
Sked Matthew J
Xerox Corporation
Young W. R.
LandOfFree
Method and apparatus for constructing finite-state networks... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for constructing finite-state networks..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for constructing finite-state networks... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3600521