Method and apparatus for mapping multiword expressions to...

Data processing: speech signal processing – linguistics – language – Speech signal processing – Recognition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C704S251000, C704S254000, C704S009000

Reexamination Certificate

active

07552051

ABSTRACT:
Multiword expressions are mapped to identifiers using finite-state networks. Each of a plurality of multiword expressions is encoded into a regular expression. Each regular expression encodes a base form common to a plurality of derivative forms defined by ones of the multiword expressions. Each of the plurality of regular expressions is compiled with factorization into a set of finite-state networks. A union of the finite-state networks in the set of finite-state networks is performed to define a multiword finite-state network and a set of subnets. The multiword finite-state network and the set of subnets are traversed to identify a path corresponding to one of the plurality of multiword expressions, wherein only transitions originating from the multiword finite-state network are accounted for to ascertain a path number identifying a base form of the one of the plurality of multiword expressions.

REFERENCES:
patent: 4555796 (1985-11-01), Sakoe
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5642522 (1997-06-01), Zaenen et al.
patent: 5644774 (1997-07-01), Fukumochi et al.
patent: 5696962 (1997-12-01), Kupiec
patent: 5819260 (1998-10-01), Lu et al.
patent: 5845306 (1998-12-01), Schabes et al.
patent: 5950184 (1999-09-01), Karttunen
patent: 6266634 (2001-07-01), Buchsbaum et al.
patent: 6321372 (2001-11-01), Poirier et al.
patent: 6393389 (2002-05-01), Chanod et al.
patent: 6629066 (2003-09-01), Jackson et al.
patent: 7346511 (2008-03-01), Privault et al.
Mohri, Mehryar, “Finite-State Transducers in Language and Speech Processing”, 1997, Association for Computational Linguistics.
Roche, Emmanuel, “Factorization of Finite-State Transducers”, Feb. 1995, Mitsubishi Electric Research Laboratories, 13 pages + Abstract.
Andre Kempe, “Factorization of Ambiguous Finite-State Transducers”, Revised Papers from the 5th International Conference on Implementation and Application of Automata, 2000.
Bauer et al., “LOCOLEX: the translation rolls off your tongue”, Proceedings of ACH-ALLC, Santa-Barbara, USA, 1995.
Breidt et al., “Formal description of Multi-word Lexemes with the Finite State formalism: IDAREX”, Proceedings of COLING, Copenhagen, Danmark, 1996.
Chanod et al., “A Non-Deterministic Tokeniser for Finite-State Parsing”, Proc. ECAI '96 workshop on ‘Extended finite state models of language’ Budapest, 1996.
Karttunen, “Constructing lexical transducers”, published in Proceedings of COLING-94, 1:406-411, Kyoto, Japan, 1994.
Lucchesi, et al., “Applications of finite automata representing large vocabularies”, Software-Practice and Experience, vol. 23(1):15-30, 1993.
Segond et al., “Using a finite-state based formalism to identify and generate multiword expressions”, Technical report MLTT-019, Rank Xerox Research Centre, Grenoble, 1995.
Segond et al., “IDAREX: formal description of German and French Multi-Word Expressions with Finite-State Technology”, MLTT-022, Nov. 1995.
Silberztein, “INTEX: a corpus processing system”, Proceedings of COLING-94, vol. 1, Kyoto, Japan, 1994.
Silberztein, “INTEX”, (English Translation: Jordan Greenwood, Edition: Cederick Fairon) available on the Internet at http://grelis.univ-fcomte.fr/intex/downloads/Manual.pdf, 2001.
Silberztein, “INTEX and the processing of natural languages”, available on the Internet at http://grelis.univ-fcomte.fr/intex/downloads/Notes.pdf.
Woods, “Transition Network Grammars of Natural Language Analysis”, in Communications of the ACM, 13, 591-606, 1970. (Reprinted in Grosz B.J., K. S. Jones and B.L. Webber (eds.) Readings in Natural Language Processing. Los Altos, USA: Morgan Kaufmann, 1986, pp. 71-87).
“XeLDA Overview” Xerox XeLDA® the linguistic engine, Jun. 2002.
“XeLDA C++ API Programmer's Guide”, Xerox XeLDA® the linguistic engine, Jun. 2002.
U.S. Appl. No. 10/216,915 entitled “Information Retrieval And Encoding Via Substring-Number Mapping”.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for mapping multiword expressions to... 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 mapping multiword expressions to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for mapping multiword expressions to... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4138479

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.