Data processing: speech signal processing – linguistics – language – Linguistics – Natural language
Reexamination Certificate
2004-05-21
2009-11-10
Smits, Talivaldis I (Department: 2626)
Data processing: speech signal processing, linguistics, language
Linguistics
Natural language
C704S001000, C704S010000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07617091
ABSTRACT:
Operations for weighted and non-weighted multi-tape automata are described for use in natural language processing tasks such as morphological analysis, disambiguation, and entity extraction.
REFERENCES:
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5642522 (1997-06-01), Zaenen et al.
patent: 7010476 (2006-03-01), Karttunen et al.
patent: 7257575 (2007-08-01), Johnston et al.
patent: 7383185 (2008-06-01), Mohri
patent: 2003/0004705 (2003-01-01), Kempe
patent: 2004/0117184 (2004-06-01), Privault et al.
patent: 2004/0128122 (2004-06-01), Privault et al.
patent: 1531400 (2006-03-01), None
Mohri, M. et al., “Weighted Finite-State Transducers In Speech Recognition”, Computer Speech And Language, vol. 16, No. 1, pp. 69-88, Jan. 2002.
Reape, M. & Thompson, H., “Parallel Intersection And Serial Composition Of Finite State Transducers”, Proceedings Of The 12th Conference On Computational Linguistics, pp. 535-539, Aug. 1988.
Kempe, A. et al., “Algorithms For Weighted Multi-Tape Automata”, XRCE Research Report, vol. 2004. No. 031, Jun. 2004, pp. 1-28.
Mohri, M., Pereira, F. & Riley, M., “The Design Principles Of A Weighted Finite-State Transducer Library”, Theoretical Computer Science, vol. 231, No. 1, pp. 17-32, Jan. 2000.
Kempe, A., “Extraction of epsilon-Cycles From Finite-State Transducers”, Lecture Notes In Computer Science, vol. 2494, pp. 190-201, 2002.
Eilenberg, Samuel, “Automata, Languages, and Machines”, vol. A. Academic Press, San Diego, CA, USA, 1974: Chapter 1, Section 3 “Monoids”, pp. 3-6; Chapter 6, Section 1 “Multiplicity in Automata”, pp. 120-122; and Chapter 6, Section 2, “Semirings”, pp. 122-126.
Eisner, Jason, “Parameter Estimation For Probabilistic Finite-State Transducers”, In Proceedings of the 40th Annual Meeting, pp. 1-8, Philadelphia, PA, USA, 2002.
Elgot, C.C. And J.E. Mezei, “On Relations Defined by Generalized Finite Automata”, IBM Journal Res. 9, pp. 47-68, 1965.
Kaplan, Ronald M. And Martin Kay, “Regular Models Of Phonological Rule Systems”, Computational Linguistics, 20(3):331-378, 1994.
Karttunen, Lauri, “The Replace Operator”, Proceedings of the 33rd Annual Meeting, pp. 16-23, Cambridge, MA, USA, 1995.
Karttunen, Lauri, Jean-Pierre Chanod, Greg Grefenstette, and Anne Schiller, “Regular Expressions For Language Engineering”, Journal of Natural Language Engineering, 2(4):307-330, 1997.
Kay, Martin, “Nonconcatenative Finite-State Morphology”, ACL Proceedings, Third European Conference 1987.
Kempe, Andre and Lauri Karttunen, “Parallel Replacement In Finite-State Calculus”, Proceedings of the 16th International Conference on Computational Linguistics (CoLing), vol. 2, pp. 622-627, Copenhagen, Denmark, ACL, cmp-lg//9607007, 1996.
Kempe, Andre, Christof Baeijs, Tamas Gaal, Franck Guingne, and Florent Nicart, “WFSC—A New Weighted Finite State Compiler”, 8th Int. Conf. on Implementation and Application of Automata (CIAA 03), Santa Barbara, CA, USA Jul. 16-18, 2003.
Kempe, Andre, “NLP Applications Based On Weighted Multi Tape Automata”, TALN, Fes, Morocco, Apr. 19-22, 2004.
Kiraz, George Anton and Edmund Grimley-Evans, “Multi-Tape Automata For Speech And Language Systems: A Prolog Implementation”, D. Woods and S. Yu, editors, Automata Implementation, No. 1436 in Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, 1998.
Kiraz, George Anton, “Linearization Of Nonlinear Lexical Representations”, ACL Special Interest Group in Computational Phonology, 1997.
Koskenniemi, Kimmo, Pasi Tapanainen, and Atro Voutilainen, “Compiling and using finite-state syntactic rules”, Proceedings of COLING'92, vol. 1, pp. 156-162, Nantes, France, 1992.
Kuich, Werner and Arto Salomaa, “Semirings, Automata, Languages”, No. 5 in EATCS Monographs on Theoretical Computer Science, Springer Verlag, Berlin, Germany, 1986: Chapter 1 “Linear Algebra”, pp. 5-103.
Mohri, Mehryar, “Finite-State Transducers In Language And Speech Processing”, Computational Linguistics, 23(2):269-312, 1997.
Mohri, Mehryar, “Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers”, International Journal of Foundations of Computer Science, 13(1):129-143, 2002.
Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley, “A Rational Design For A Weighted Finite-State Transducer Library”, Lecture Notes in Computer Science, 1436:144-158, 1998.
Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley, “Weighted Automata in Text and Speech Processing”, Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECAI-96), Workshop on Extended finite state models of language, Budapest, Hungary, 1996.
Pereira, Fernando C. N. and Michael D. Riley, “Speech Recognition By Composition Of Weighted Finite Automata”, Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing. MIT Press, Cambridge, MA, USA, pp. 431-453, 1997.
Schulz, Klaus U. and Stoyan Mihov, “Fast String Correction With Levenshtein Automata”, International Journal on Document Analysis and Recognition (IJDAR), 5(1):67-85, 2002.
Stethem, Scott, Review of “Morphology and Computation” by Richard Sproat, the MIT Press 1992, in Computational Linguistics, v.18 n.4, pp. 552-554, Dec. 1992.
Guingne Franck
Kempe Andre
Nicart Florent
Fay Sharpe LLP
Smits Talivaldis I
Spooner Lamont M
Xerox Corporation
LandOfFree
Method and apparatus for processing natural language using... 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 processing natural language using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for processing natural language using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4138863