Skip to main content

Voice AI consulting through Voicebre Systems

A note on what I do when I am not writing about KALDI graphs: I take on voice AI work through Voicebre Systems, a small consultancy based in Prague.

Three things, mostly: custom speech recognition — including voice commands and languages that the off-the-shelf stacks handle badly; natural language understanding for conversational systems; and end-to-end voice agents, from VUI design through to integration with whatever is already running in the business.

The interesting problems are usually not the model. They are the data you are allowed to use, the latency budget, and what happens on the turn where the user says something nobody anticipated. If that is the shape of your problem, get in touch.

Labels:

Comments

Post a Comment

Popular posts from this blog

Viterbi Algorithm in C++ and using STL

To practice my C++ and STL skills, I implemented the Viterbi algorithm example from the Wikipedia page:  http://en.wikipedia.org/wiki/Viterbi_algorithm . The original algorithm was implemented in Python. I reimplemented the example in C++ and I used STL (mainly  vector  and  map  classes).  This code is in public-domain. So, use it as you want.  The complete solution for MS Visual C++ 2008 can be found at  http://filip.jurcicek.googlepages.com/ViterbiSTL.rar // ViterbiSTL.cpp : is an C++ and STL implementatiton of the Wikipedia example // Wikipedia: http://en.wikipedia.org/wiki/Viterbi_algorithm#A_concrete_example // It as accurate implementation as it was possible #include "stdafx.h" #include "string" #include "vector" #include "map" #include "iostream" using namespace std; //states = ('Rainy', 'Sunny') //  //observations = ('walk', 'shop', 'clean') //  //start_probability = {'Rainy': 0.6...
6 comments
Read more

how the make HCL and G graphs, and on the fly compositon of HCL and G for KALDI

Well, I had again to do something ;-) The task is to generate/create/update a decoding graph for KALDI on the fly. In my case, I aim at changing a G (grammar) in the context of a dialogue system. One can generate a new HCLG but this would take a lot of time as this involves FST determinization, epsilon-removal, minimization, etc. Therefore, I tried to use on-the-fly composition of statically prepared HCL and G. At first, I struggled with it but later I made it work. See  https://github.com/jpuigcerver/kaldi-decoders/issues/1 Here is a short summary: At the end, I managed to get LabelLookAheadMatcher to work. It is mostly based on the code and examples in opendcd, e.g. https://github.com/opendcd/opendcd/blob/master/script/makegraphotf.sh . First, Here is how I build and prepare the HCL and G. Please not that OpenFST must be compiled with  --enable-lookahead-fsts , see http://www.openfst.org/twiki/bin/view/FST/ReadMe . #--------------- fstdeterminize ${lang}/...
2 comments
Read more

Privacy policy

 Privacy Policy Effective date: 2024-02-16 This Privacy Policy applies to the website [bozskyfilip.blogspot.com] operated by [Filip Jurcicek] ("us", "we", or "our"). This Policy informs you of our policies regarding the collection, use, and disclosure of personal data we receive from users of our website. 1. Information Collection and Use We may collect and process the following types of data: 1.1 Personal Data: We may collect personally identifiable information including, but not limited to, your name, email address, and contact information. We collect this information for the purpose of providing and improving our services to you. 1.2 Usage Data: We may collect non-personally identifiable information about how you use our website. This may include your IP address, browser type, device type, operating system, and other similar information. We collect this information to analyze trends, administer the site, track users' movements, and gather demographi...
Post a Comment
Read more