Get started
Author

Sagar Indurkhya

Observed names: Indurkhya, Sagar, Indurkhya, Sagar., S. Indurkhya
OpenAlex ID: A5073085825
Colorless green ideas do sleep furiously: gradient acceptability and the nature of the grammar
2018 · Jon Sprouse, Beracah Yankama, et al. · The Linguistic Review · 67
Reaction Factoring and Bipartite Update Graphs Accelerate the Gillespie Algorithm for Large-Scale Biochemical Systems
2010 · Sagar Indurkhya, Jacob Beal · PLoS ONE · 23
Engineering novel synthetic biological systems
2007 · F. Reza, E. Josephs, et al. · IET Synthetic Biology · 8
Inferring Minimalist Grammars with an SMT-Solver
2020 · Indurkhya, Sagar · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · 4
PDF
Parsing as Deduction Revisited: Using an Automatic Theorem Prover to Solve an SMT Model of a Minimalist Parser
2022 · Sagar Indurkhya · Conference on Computational Natural Language Learning · 2
PDF
Evaluating Universal Dependency Parser Recovery of Predicate Argument Structure via CompChain Analysis
2021 · Sagar Indurkhya, Beracah Yankama, et al. · 2
PDF
Evaluating the Cognitively-Related Productivity of a Universal Dependency Parser
2021 · Sagar Indurkhya, Robert C. Berwick · IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC) · 1
Using Collaborative Filtering to Model Argument Selection
2021 · Sagar Indurkhya · 1
PDF
Solving for syntax
2021 · Indurkhya, Sagar. · DSpace@MIT (Massachusetts Institute of Technology)
Automatic Inference of Minimalist Grammars using an SMT-Solver
2019 · Indurkhya, Sagar · arXiv (Cornell University)
PDF
Acquiring minimalist grammars via constraint satisfaction
2015 · Sagar Indurkhya · DSpace@MIT (Massachusetts Institute of Technology)
PDF
Code for LOLCAT Method (Variant of Gillespie Algorithm)
2009 · Jacob Beal, Sagar Indurkhya · DSpace@MIT (Massachusetts Institute of Technology)
Works count: 15
Citation count: 108
H-index: 4
I10-index: 2
Year
Topic
Type