default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCyril Allauzen
- > Home > Persons > Cyril Allauzen
Publications
- 2011
[j9]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata and the Double-Tape Ambiguity of Finite-State Transducers. Int. J. Found. Comput. Sci. 22(4): 883-904 (2011)- [j8]Cyril Allauzen, Corinna Cortes, Mehryar Mohri:
A Dual Coordinate Descent Algorithm for SVMs Combined with Rational Kernels. Int. J. Found. Comput. Sci. 22(8): 1761-1779 (2011) - 2010
- [c22]Cyril Allauzen, Shankar Kumar, Wolfgang Macherey, Mehryar Mohri, Michael Riley:
Expected Sequence Similarity Maximization. HLT-NAACL 2010: 957-965 - [c21]Cyril Allauzen, Corinna Cortes, Mehryar Mohri:
Large-Scale Training of SVMs with Automata Kernels. CIAA 2010: 17-27 - 2009
- [j6]Cyril Allauzen, Mehryar Mohri:
N-Way Composition of Weighted Finite-State Transducers. Int. J. Found. Comput. Sci. 20(4): 613-627 (2009) - [i3]Cyril Allauzen, Mehryar Mohri:
Linear-Space Computation of the Edit-Distance between a String and a Finite Automaton. CoRR abs/0904.4686 (2009) - 2008
- [c17]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata. Developments in Language Theory 2008: 108-120 - [c16]Cyril Allauzen, Mehryar Mohri, Ameet Talwalkar:
Sequence kernels for predicting protein essentiality. ICML 2008: 9-16 - [c15]Cyril Allauzen, Mehryar Mohri:
3-Way Composition of Weighted Finite-State Transducers. CIAA 2008: 262-273 - [i2]Cyril Allauzen, Mehryar Mohri:
3-Way Composition of Weighted Finite-State Transducers. CoRR abs/0802.1465 (2008) - [i1]Cyril Allauzen, Mehryar Mohri, Ashish Rastogi:
General Algorithms for Testing the Ambiguity of Finite Automata. CoRR abs/0802.3254 (2008) - 2007
- [c14]Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri:
OpenFst: A General and Efficient Weighted Finite-State Transducer Library. CIAA 2007: 11-23 - 2006
- [c13]Cyril Allauzen, Mehryar Mohri:
A Unified Construction of the Glushkov, Follow, and Antimirov Automata. MFCS 2006: 110-121 - 2005
- [j5]Cyril Allauzen, Mehryar Mohri, Brian Roark:
The design principles and algorithms of a weighted grammar library. Int. J. Found. Comput. Sci. 16(3): 403-421 (2005) - 2004
- [j4]Cyril Allauzen, Mehryar Mohri:
An optimal pre-determinization algorithm for weighted transducers. Theor. Comput. Sci. 328(1-2): 3-18 (2004) - [c10]Mehryar Mohri, Cyril Allauzen, Michael Riley:
Statistical Modeling for Unit Selection in Speech Synthesis. ACL 2004: 55-62 - [c9]Cyril Allauzen, Mehryar Mohri, Michael Riley, Brian Roark:
A generalized construction of integrated speech recognition transducers. ICASSP (1) 2004: 761-764 - [c8]Cyril Allauzen, Mehryar Mohri, Brian Roark:
A General Weighted Grammar Library. CIAA 2004: 23-34 - 2003
- [j3]Cyril Allauzen, Mehryar Mohri:
Finitely Subsequential Transducers. Int. J. Found. Comput. Sci. 14(6): 983-994 (2003) - [j2]Cyril Allauzen, Mehryar Mohri:
Efficient Algorithms for Testing the Twins Property. J. Autom. Lang. Comb. 8(2): 117-144 (2003) - [c7]Cyril Allauzen, Mehryar Mohri, Brian Roark:
Generalized Algorithms for Constructing Statistical Language Models. ACL 2003: 40-47 - [c6]Cyril Allauzen, Mehryar Mohri:
Generalized optimization algorithm for speech recognition transducers. ICASSP (1) 2003: 352-355 - [c5]Cyril Allauzen, Mehryar Mohri:
An Efficient Pre-determinization Algorithm. CIAA 2003: 83-95 - 2002
- [c4]Cyril Allauzen, Mehryar Mohri:
p-Subsequentiable Transducers. CIAA 2002: 24-34
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-08-08 20:11 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:
