Nexidia’s roots in this field run deep, extending to original research at the Georgia Institute of Technology where the phonetic indexing and search approach was first developed as a superior alternative to the slow, inaccurate process of large vocabulary continuous speech recognition (speech-to-text). With the original inventor still on staff, and additional research scientists from places such as the Massachusetts Institute of Technology and Carnegie Mellon University, Nexidia continues to innovate and improve on its core intellectual property. A list of current patents follows:
Issued Patents | Technology Description |
| Transcript Alignment Patent 7,231,351; issued June 12, 2007 | Application of phonetic indexing and search to robustly time-align a transcript with audio |
| Phonetic Searching Patent 7,263,484; issued August 28, 2007 | Creation and search of phonetic index for audio/video files |
| Phonetic Searching Patent 7,313,521; issued December 25, 2007 | Assessment of search term quality |
| Phonetic Searching Patent 7,324,939; issued January 29, 2008 | Indexing and search covering both forward and backward directions in time |
| Phonetic Searching Patent 7,406,415; issued July 29, 2008 | Structured queries: combination of search terms via Boolean and time-based operators |
| Phonetic Searching Patent 7,475,065; issued January 6, 2009 | Search via linguistic search term plus phonetic search term or voice command |
| Transcript Alignment Patent 7,487,086; issued February 3, 2009 | Search of phonetic index and/or textual transcript |
| Wordspotting System Patent 7,640,161; issued December 29, 2009 | Pronunciation optimization: iterative refinement of target search pronunciation |
| Wordspotting System Normalization Patent 7,650,282; issued January 19, 2010 | Structured query normalization: statistical modeling of score distributions of potential hits to characterize and reduce false alarms to improve accuracy; auto thresholding |
© 2008 Nexidia, Incorporated. All Rights Reserved. | Legal Notice | Privacy Policy | Contact Us