default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Sven Ristad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1993
[b2]Eric Sven Ristad:
The language complexity game. MIT Press 1993, ISBN 978-0-262-18147-1, pp. I-XV, 1-48- 1990
- [b1]Eric Sven Ristad:
Computational structure of human language. Massachusetts Institute of Technology, Cambridge, MA, USA, 1990
Journal Articles
- 1998
- [j2]Eric Sven Ristad, Peter N. Yianilos:
Learning String-Edit Distance. IEEE Trans. Pattern Anal. Mach. Intell. 20(5): 522-532 (1998) - 1993
- [j1]Eric Sven Ristad:
The Anaphora Problem. Inf. Comput. 105(1): 105-131 (1993)
Conference and Workshop Papers
- 1997
- [c11]Eric Sven Ristad, Robert G. Thomas:
Hierarchical Non-Emitting Markov Models. ACL 1997: 381-385 - [c10]Eric Sven Ristad, Robert G. Thomas:
Nonuniform Markov models. ICASSP 1997: 791-794 - [c9]Eric Sven Ristad, Peter N. Yianilos:
Learning String Edit Distance. ICML 1997: 287-295 - 1995
- [c8]Eric Sven Ristad, Robert G. Thomas:
New Techniques for Context Modeling. ACL 1995: 220-227 - [c7]Eric Sven Ristad, Robert G. Thomas:
Context Models in the MDL Framework. Data Compression Conference 1995: 62-71 - 1992
- [c6]Jorma Rissanen, Eric Sven Ristad:
Language acquisition in the MDL framework. Language Computations 1992: 149-166 - [c5]Eric Sven Ristad:
Complexity of morpheme acquisition. Language Computations 1992: 185-198 - 1990
- [c4]Eric Sven Ristad:
Computational Structure of Generative Phonology and its Relation to Language Comprehension. ACL 1990: 235-242 - 1987
- [c3]Eric Sven Ristad:
Revised Generalized Phrase Structure Grammar. ACL 1987: 243-250 - 1986
- [c2]Eric Sven Ristad:
Computational Complexity of Current GPSG Theory. ACL 1986: 30-39 - [c1]Eric Sven Ristad:
Defining Natural Language Grammars in GPSG. ACL 1986: 40-44
Editorship
- 1994
- [e1]Eric Sven Ristad:
Language Computations, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA , March 20-22, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 17, DIMACS/AMS 1994, ISBN 978-0-8218-6608-5 [contents]
Informal and Other Publications
- 1998
- [i7]Eric Sven Ristad, Robert G. Thomas:
Hierarchical Non-Emitting Markov Models. CoRR cmp-lg/9801001 (1998) - 1997
- [i6]Eric Sven Ristad, Peter N. Yianilos:
Library of Practical Abstractions, Release 1.2. CoRR cmp-lg/9706009 (1997) - 1996
- [i5]Eric Sven Ristad, Peter N. Yianilos:
Learning string edit distance. CoRR cmp-lg/9610005 (1996) - [i4]Eric Sven Ristad, Robert G. Thomas:
Nonuniform Markov models. CoRR cmp-lg/9611004 (1996) - [i3]Eric Sven Ristad:
Maximum Entropy Modeling Toolkit. CoRR cmp-lg/9612005 (1996) - 1995
- [i2]Eric Sven Ristad:
A Natural Law of Succession. CoRR abs/cmp-lg/9508012 (1995) - [i1]Eric Sven Ristad, Robert G. Thomas:
New Techniques for Context Modeling. CoRR cmp-lg/9505002 (1995)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
