Method and apparatus for compiling context-dependent rewrite rul

Data processing: speech signal processing – linguistics – language – Linguistics – Natural language

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

704257, G06F 1728, G10L 506, G10L 900

Patent

active

060321113

ABSTRACT:
A system and method for compiling weighted context-dependent rewrite rules into weighted finite-state transducers introduces context marking symbols only when and where they are needed. In particular, the compiler and compiling method use a composition of five simple finite-state transducers generated from a weighted context-dependent rewrite rule to represent that rule. An "r" finite-state transducer is generated from the right context portion .rho. of the weighted context-dependent rewrite rule. An "f" finite-state transducer is generated from the rewritten portion .phi. of the weighted context-dependent rewrite rule. A "Replace" finite-state transducer is generated from the rewritten and replacement portions .phi. and .psi. of the weighted context-dependent rewrite rule. Finally, "l.sub.1 " and "l.sub.2 " finite-state transducers are generated from the left context portion .lambda. of the weighted context-dependent rewrite rule. The "r" and "f" finite-state transducer generators of the compiler and the transducer generating steps of the compiling method introduce the context marking symbols "<.sub.1 ", "<.sub.2 " and ">" in the various finite-state transducers only when and where they are needed. The right context marker symbol ">" is added to the "r" finite-state transducer only immediately before each occurrence of .rho.. The left context markers "<.sub.1 " and "<.sub.2 " are added to the "f" finite-state transducer only immediately before each occurrence of .phi., neglecting any occurrences of the right marker symbol ">". The "Replace", "l.sub.1 " and "l.sub.2 " finite-state transducers then appropriately remove the right and left context markers when replacing .phi. with .psi., and whether .lambda. precedes .phi. in the input string.

REFERENCES:
patent: 5594641 (1997-01-01), Kaplan et al.
patent: 5625554 (1997-04-01), Cutting et al.
patent: 5721939 (1998-02-01), Kaplan
patent: 5806032 (1998-09-01), Sproat
"Regular Models of Phonological Rule Systems", Ronald M. Kaplan and Martin Kay, ISTL-NLTT-1993-05-01, Oct. 29, 1993.
"Formal Aspects of Phonological Description", pp. 10-17, 20-125, C. Douglas Johnson, University of California, Santa Barbara, 1972.
"An Efficient Compiler for Weighted Rewrite Rules", M. Mohri & R. Sproat, Annual Meeting of the Association for Computational Linguistics, Univ. of Cal., Santa Cruz, CA, Jun. 24-27, 1996.
"Compilation of Weighted Finite-State Transducers from Decision Trees", R. Sproat & M. Riley, Annual Meeting of the Association for Computational Linguistics, Univ. of Cal., Santa Cruz, Santa Cruz, CA, Jun. 24-27, 1996.

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

Rate now

     

Profile ID: LFUS-PAI-O-691918

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