Jonathan Graehl
Biographic Data
| ID | 6536916 |
|---|---|
| NAME | Jonathan Graehl |
| GIVEN NAMES | Jonathan |
| FAMILY NAME | Graehl |
| SIGNATURE | GRAEHL J |
| AFFILIATIONS | University of Southern California, Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, CA 90292.. |
| VERIFIED | No |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 1 |
| WORKS AS AUTHOR | 1 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2008 |
| LATEST PUBLICATION YEAR | 2008 |
| H-INDEX | 1 |
Training Tree Transducers
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem…
Training Tree Transducers
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem…
Training Tree Transducers
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for granted in (finite-state) string-based modeling. The theory of tree transducer automata provides a possible framework to draw on, as it has been worked out in an extensive literature. We motivate the use of tree transducers for natural language and address the training problem…
Algorithms and Data Compression (1 work) · Computer Science (1 work) · Electrical engineering (1 work) · Engineering (1 work) · Handwritten Text Recognition Techniques (1 work) · Mathematics (1 work) · Natural Language Processing Techniques (1 work) · Transducer (1 work) · Tree (set theory (1 work)