Information retrieval and encoding via substring-number mapping

Details Information retrieval and encoding via substring-number mapping Information retrieval and encoding via substring-number mapping

2006-07-04

2006-07-04

Wong, Leslie (Department: 2167)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C704S002000, C704S009000, C704S010000, C341S078000

Reexamination Certificate

active

07072880

ABSTRACT:
A finite-state network that supports substring-number mapping is compiled from a grammar that includes a plurality of classes of substrings. Each of the plurality of classes of substrings has a finite number of substrings. In applying the network to an input string, substrings are identified in the input string. Some or all of the substrings identified in the input string are mapped to a unique index within their class. This unique index is labeled with an identifier that identifies its class to define a labeled index. The string is encoded by forming a set of labeled indices using the labeled index of each substring of the input string.

REFERENCES:
patent: 5325091 (1994-06-01), Kaplan et al.
patent: 5500920 (1996-03-01), Kupiec
patent: 5523946 (1996-06-01), Kaplan et al.
patent: 5551026 (1996-08-01), Kaplan et al.
patent: 5551049 (1996-08-01), Kaplan et al.
patent: 5553283 (1996-09-01), Kaplan et al.
patent: 5642522 (1997-06-01), Zaenen et al.
patent: 5706364 (1998-01-01), Kopec et al.
patent: 5706400 (1998-01-01), Omlin et al.
patent: 5754847 (1998-05-01), Kaplan et al.
patent: 5787386 (1998-07-01), Kaplan et al.
patent: 5790599 (1998-08-01), Wright et al.
patent: 5950184 (1999-09-01), Karttunen
patent: 6233580 (2001-05-01), Kaplan et al.
patent: 6239727 (2001-05-01), Crochemore et al.
patent: 6278973 (2001-08-01), Chung et al.
patent: 2002/0168664 (2002-11-01), Murray et al.
Word Finder Plus,Macintosh Version, Microlytics, Inc., pp. 2-12, 1992.
XeLDA the Linquistic Engine, “XeLDA Overview,”Xerox Multilingual Knowledge Management Solutions, pp. 4-37, Jun. 2002.
Appel, A. and Jacobson, G., “The world's fastest scrabble program”, in Communications of the ACM, 31(5):572-578, 1998.
Beesley, K. R., “Constraining separated morphotactic dependencies in finite-size grammars”, in FSMNLP-98, pp. 118-127, Bilkent. Bilkent University, 1998.
Karttunen, L., Kaplan, R.M., and Zaenen, A., “Two-level morphology with composition”, in COLING'92, pp. 141-148, Nantes, France, 1992.
Koskenniemi, K., “Two-level morphology: A general computational model for word form recognition and production”, in Publication 11, University of Helsinki, Deparment of General Linguistics, Helsinki, 1983.
Lucchesi, C. L. and Kowaltowski, T., “Applications of finite automata representing large vocabularies”, in Software-Practice and Experience, 23(1):15-30, 1993.
Bauer, D., Segond, F., Zaenen, A., “LOCOLEX: The Translation Rolls off Your Tongue”, in Proceedings of the conference of the Association for Computers and the Humanities and the Association for Literary and Linguistic Computing, (ACH-ALLC'95) Santa Barbara, USA, Jul. 1995.

Affiliated with

Also associated with

Rating

Information retrieval and encoding via substring-number mapping does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Information retrieval and encoding via substring-number mapping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information retrieval and encoding via substring-number mapping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3531737