From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization.

J. Johnson. CIAA, том 6482 из Lecture Notes in Computer Science, стр. 173-180. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

A Unified Framework for Disambiguating Finite Transductions.J. Johnson. Theor. Comput. Sci., 63 (1): 91-111 (1989)Using textual redundancy to understand change.J. Johnson. CASCON, стр. 34. IBM, (1995)Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization.J. Johnson. CIAA, том 6482 из Lecture Notes in Computer Science, стр. 173-180. Springer, (2010)Identifying redundancy in source code using fingerprints.J. Johnson. CASCON, стр. 171-183. IBM, (1993)Instruction Computation in Subset Construction.J. Johnson, и D. Wood. Workshop on Implementing Automata, том 1260 из Lecture Notes in Computer Science, стр. 64-71. Springer, (1996)Rational Equivalence Relations.J. Johnson. ICALP, том 226 из Lecture Notes in Computer Science, стр. 167-176. Springer, (1986)Do Rational Equivalence Relations have Regular Cross-Sections?J. Johnson. ICALP, том 194 из Lecture Notes in Computer Science, стр. 300-309. Springer, (1985)Lessons from INR in the Specification of Transductions.J. Johnson. CIAA, том 2088 из Lecture Notes in Computer Science, стр. 335-336. Springer, (2000)Navigating the textual redundancy web in legacy source.J. Johnson. CASCON, стр. 16. IBM, (1996)Visualizing textual redundancy in legacy source.J. Johnson. CASCON, стр. 32. IBM, (1994)