Menu
▾
▴
kaldi-developers — Kaldi Developers
You can subscribe to this list here.
| 2011 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
(4) |
Jul
|
Aug
|
Sep
(1) |
Oct
(4) |
Nov
(1) |
Dec
(14) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2012 |
Jan
(1) |
Feb
(8) |
Mar
|
Apr
(1) |
May
(3) |
Jun
(13) |
Jul
(7) |
Aug
(11) |
Sep
(6) |
Oct
(14) |
Nov
(16) |
Dec
(1) |
| 2013 |
Jan
(3) |
Feb
(8) |
Mar
(17) |
Apr
(21) |
May
(27) |
Jun
(11) |
Jul
(11) |
Aug
(21) |
Sep
(39) |
Oct
(17) |
Nov
(39) |
Dec
(28) |
| 2014 |
Jan
(36) |
Feb
(30) |
Mar
(35) |
Apr
(17) |
May
(22) |
Jun
(28) |
Jul
(23) |
Aug
(41) |
Sep
(17) |
Oct
(10) |
Nov
(22) |
Dec
(56) |
| 2015 |
Jan
(30) |
Feb
(32) |
Mar
(37) |
Apr
(28) |
May
(79) |
Jun
(18) |
Jul
(35) |
Aug
|
Sep
(1) |
Oct
|
Nov
|
Dec
|
|
From: Sakriani S. <ss...@is...> - 2013-11-18 04:34:25
|
Hi Daniel and Vassil, Thank you for the response. We first learn from voxforge setup. As we need to put our ASR in the server and receive the input directly from the microphone, we currently use: onlinebin/online-audio-server-decode-faster with following parameters: beam=15.0 rt-min=0.5 rt-max=3.0 Our old system based on Julius decoder, but compare with Julius, the response with Kaldi online decoding is really slow. Please let us know how to make sure it stays within real time. Thank you. -Sakti- On 2013/11/17 1:04, Vassil Panayotov wrote: > Yes it has some basic/experimental logic to automatically tweak the > beam according to the current decoding real time > factor(--rt-min/--rt-max parameters), but I don't think anyone has > tested how well it works in practice(my impressions is that it's far > from perfect). > If this doesn't work for the original poster for some reason, the only > other options that wouldn't require changing the code would be to > tweak the beam or the maximum active states. > > Vassil > > On Sat, Nov 16, 2013 at 5:46 PM, Daniel Povey <dp...@gm...> wrote: >> When you say the online decoding, you mean e.g. the voxforge setup? >> the stuff in onlinebin/ ? I thought the online decoder had a >> mechanism to make sure it stays within real time. >> Dan >> >> >> On Fri, Nov 15, 2013 at 12:18 AM, Sakriani Sakti <ss...@is...> wrote: >>> Dear Kaldi-developers, >>> >>> First of all, we would like to join Kaldi-users mailing list. Please kindly >>> include me into Kaldi-users mailing list. >>> >>> We are currently build simultaneous speech translation, where we >>> build the ASR system using Kaldi. To construct simultaneous speech >>> translation, we really need real-time ASR decoding. Currently, the >>> online decoding in Kaldi seems respond very slow and we couldn't find >>> the way to multi-thread decoding as in offline case. Is there any way, to >>> make the online decoding a little faster? >>> >>> Another things, the ctm format file mainly output the recognized word >>> with time information. Is there any way to get more detail information, >>> such as phone with time information or HMM-state with time information >>> as in HTK decoding output? >>> >>> It would be great if you could help us for this. >>> Thank you. >>> Sincerely yours, >>> Sakriani Sakti >>> >>> >>> ------------------------------------------------------------------------------ >>> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >>> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >>> Free app hosting. Or install the open source package on any LAMP server. >>> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >>> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >>> _______________________________________________ >>> Kaldi-developers mailing list >>> Kal...@li... >>> https://lists.sourceforge.net/lists/listinfo/kaldi-developers >> ------------------------------------------------------------------------------ >> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >> Free app hosting. Or install the open source package on any LAMP server. >> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >> _______________________________________________ >> Kaldi-developers mailing list >> Kal...@li... >> https://lists.sourceforge.net/lists/listinfo/kaldi-developers |
|
From: Vassil P. <vas...@gm...> - 2013-11-16 16:04:59
|
Yes it has some basic/experimental logic to automatically tweak the beam according to the current decoding real time factor(--rt-min/--rt-max parameters), but I don't think anyone has tested how well it works in practice(my impressions is that it's far from perfect). If this doesn't work for the original poster for some reason, the only other options that wouldn't require changing the code would be to tweak the beam or the maximum active states. Vassil On Sat, Nov 16, 2013 at 5:46 PM, Daniel Povey <dp...@gm...> wrote: > When you say the online decoding, you mean e.g. the voxforge setup? > the stuff in onlinebin/ ? I thought the online decoder had a > mechanism to make sure it stays within real time. > Dan > > > On Fri, Nov 15, 2013 at 12:18 AM, Sakriani Sakti <ss...@is...> wrote: >> Dear Kaldi-developers, >> >> First of all, we would like to join Kaldi-users mailing list. Please kindly >> include me into Kaldi-users mailing list. >> >> We are currently build simultaneous speech translation, where we >> build the ASR system using Kaldi. To construct simultaneous speech >> translation, we really need real-time ASR decoding. Currently, the >> online decoding in Kaldi seems respond very slow and we couldn't find >> the way to multi-thread decoding as in offline case. Is there any way, to >> make the online decoding a little faster? >> >> Another things, the ctm format file mainly output the recognized word >> with time information. Is there any way to get more detail information, >> such as phone with time information or HMM-state with time information >> as in HTK decoding output? >> >> It would be great if you could help us for this. >> Thank you. >> Sincerely yours, >> Sakriani Sakti >> >> >> ------------------------------------------------------------------------------ >> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >> Free app hosting. Or install the open source package on any LAMP server. >> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >> _______________________________________________ >> Kaldi-developers mailing list >> Kal...@li... >> https://lists.sourceforge.net/lists/listinfo/kaldi-developers > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers |
|
From: Daniel P. <dp...@gm...> - 2013-11-16 15:46:22
|
When you say the online decoding, you mean e.g. the voxforge setup? the stuff in onlinebin/ ? I thought the online decoder had a mechanism to make sure it stays within real time. Dan On Fri, Nov 15, 2013 at 12:18 AM, Sakriani Sakti <ss...@is...> wrote: > Dear Kaldi-developers, > > First of all, we would like to join Kaldi-users mailing list. Please kindly > include me into Kaldi-users mailing list. > > We are currently build simultaneous speech translation, where we > build the ASR system using Kaldi. To construct simultaneous speech > translation, we really need real-time ASR decoding. Currently, the > online decoding in Kaldi seems respond very slow and we couldn't find > the way to multi-thread decoding as in offline case. Is there any way, to > make the online decoding a little faster? > > Another things, the ctm format file mainly output the recognized word > with time information. Is there any way to get more detail information, > such as phone with time information or HMM-state with time information > as in HTK decoding output? > > It would be great if you could help us for this. > Thank you. > Sincerely yours, > Sakriani Sakti > > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers |
|
From: Daniel P. <dp...@gm...> - 2013-11-15 16:03:31
|
What you're talking about here is basis-fMLLR, not regular fMLLR. basis-fMLLR is a kind of fMLLR suitable for adapting on short data, e.g. 10 to 30 seconds of data per speaker. You probably just want regular fMLLR in this instance. Do e.g. train_sat.sh and decode_fmllr.sh, that is the normal recipe. basis_fmllr is something for a special case Dan > Dear Kaldi Authors, > > I want to use the fmllr adaptation, but in the wsj/s5 recipe > [ger_fmllr_basis.sh] script, > > it is written that: > --------------------------------------------------------- > per_utt=true > If true, then treat each utterance as a separate speaker for purposes of > basis training... this is recommended if the number of actual speakers in > your > training set is less than (feature-dim) * (feature-dim+1). > --------------------------------------------------------- > > If I don't have the number of speaker >= ~1500 in my training set, than > fmllr adaptation per speaker is not good? > > Can you please explain in some detail? > > I have a small set of data about 1000 utterances, that comes from 5 speaker > with 3 to 4 second per utterance. Like between 100 - 200 utterances per > speaker. What kind of adaptation technique should I use to get good results > per speaker? > > Best regards, > Arif > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > |
|
From: Arif K. <ife...@gm...> - 2013-11-15 14:48:10
|
Dear Kaldi Authors, I want to use the fmllr adaptation, but in the wsj/s5 recipe *[ger_fmllr_basis.sh]* script, it is written that: --------------------------------------------------------- *per_utt=true * If true, then treat each utterance as a separate speaker for purposes of basis training... this is recommended if the number of actual speakers in your training set is less than *(feature-dim) * (feature-dim+1).* --------------------------------------------------------- If I don't have the number of speaker >= ~1500 in my training set, than fmllr adaptation per speaker is not good? Can you please explain in some detail? I have a small set of data about 1000 utterances, that comes from 5 speaker with 3 to 4 second per utterance. Like between 100 - 200 utterances per speaker. What kind of adaptation technique should I use to get good results per speaker? Best regards, Arif |
|
From: Sakriani S. <ss...@is...> - 2013-11-15 05:43:17
|
Dear Kaldi-developers, First of all, we would like to join Kaldi-users mailing list. Please kindly include me into Kaldi-users mailing list. We are currently build simultaneous speech translation, where we build the ASR system using Kaldi. To construct simultaneous speech translation, we really need real-time ASR decoding. Currently, the online decoding in Kaldi seems respond very slow and we couldn't find the way to multi-thread decoding as in offline case. Is there any way, to make the online decoding a little faster? Another things, the ctm format file mainly output the recognized word with time information. Is there any way to get more detail information, such as phone with time information or HMM-state with time information as in HTK decoding output? It would be great if you could help us for this. Thank you. Sincerely yours, Sakriani Sakti |
|
From: Daniel P. <dp...@gm...> - 2013-11-13 17:59:49
|
At some point we'll probably develop some example scripts for this multilingual neural-net stuff. Right now I'm busy with other things and I don't know of anyone else who is working on this right now. Dan On Wed, Nov 13, 2013 at 9:19 AM, Chao Weng <cw...@gm...> wrote: > Hi, > > You can easily do it now with the Kaldi by treating shared hidden layers as > the feature transform. Don't think it's necessary to add the corresponding > module for it. > > Bests, > Chao > > > On Mon, Nov 11, 2013 at 10:07 AM, 雪莲 <amy...@16...> wrote: >> >> Dear sir, >> Recently, Microsoft published a paper named "cross-language >> knowledge transfer using multi-lingual deep neural network with shared >> hidden layers". It's very useful. Maybe you could build a shared layer DNN >> tool or module for multi-lingual recognition? That's a suggestion for making >> Kaldi a better toolkit. If you planning on doing it, please let me know. >> love kaldi! >> best wishes! >> >> Amy >> >> >> >> >> ------------------------------------------------------------------------------ >> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >> Free app hosting. Or install the open source package on any LAMP server. >> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >> >> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >> _______________________________________________ >> Kaldi-developers mailing list >> Kal...@li... >> https://lists.sourceforge.net/lists/listinfo/kaldi-developers >> > > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > |
|
From: Daniel P. <dp...@gm...> - 2013-11-13 17:44:29
|
You might have the RM data in a previous format, perhaps the s4 scripts have been hardened to take account of it. If you can figure out how to fix the s5 data-preparation scripts to make it work, let us know. Dan On Wed, Nov 13, 2013 at 8:06 AM, Nagendra Goel <nag...@go...> wrote: > Please looks at kaldi.sf.net in the data preparation section. > > On Nov 13, 2013 7:35 AM, "Disha Kaur Phull" <dk...@gm...> wrote: >> >> >> >> ---------- Forwarded message ---------- >> From: Disha Kaur Phull <dk...@gm...> >> Date: Tue, Nov 12, 2013 at 10:22 AM >> Subject: Regarding Working of KALDI >> To: kal...@so... >> >> >> >> I am Disha Kaur a research Scholar from VIT University. I am doing my >> research in the field of Speech Recognition. >> I am trying to work with the KALDI toolkit. I was able to run the demo >> example given in rm, s4(This only worked for me). >> I want to give my own data to it but was not able to follow with it and >> getting errors can you guide me with any documentation or steps that would >> help me learn this tool better. >> >> My Contact Information: >> >> Email ID: dk...@gm..., dis...@vi... >> >> -- >> With Regards, >> >> Disha Kaur Phull >> Research Scholar >> VIT University >> Chennai Campus >> >> >> ------------------------------------------------------------------------------ >> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >> Free app hosting. Or install the open source package on any LAMP server. >> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >> >> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >> _______________________________________________ >> Kaldi-developers mailing list >> Kal...@li... >> https://lists.sourceforge.net/lists/listinfo/kaldi-developers >> > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > |
|
From: Daniel P. <dp...@gm...> - 2013-11-13 16:41:51
|
I think that is an old link, LDC removed it. Perhaps 'you're using the "stable" branch? Dan On Wed, Nov 13, 2013 at 9:03 AM, Vassil Panayotov <vas...@gm...> wrote: > By the way the 'trunk' version of Kaldi is using: > wget -T 10 -t 3 http://merlin.fit.vutbr.cz/kaldi/sph2pipe_v2.5.tar.gz > > (just checked and seems to work) > Vassil > > On Tue, Nov 12, 2013 at 4:09 PM, Rahil Mahdian <mah...@gm...> wrote: >> Dear Sir/Madam, >> >> I am installing Kaldi but I have been stuck in a place: >> >> $ wget ftp://ftp.ldc.upenn.edu/pub/ldc/misc_sw/sph2pipe_v2.5.tar.gz >> >> then in ... ==> PSAV . couldn't connect to 128.91.252.156 port 65373: >> Connection timed out >> Retrying. >> >> What should I do? >> >> Regards, >> Rahil Mahdian >> >> ------------------------------------------------------------------------------ >> DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps >> OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access >> Free app hosting. Or install the open source package on any LAMP server. >> Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! >> http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk >> _______________________________________________ >> Kaldi-developers mailing list >> Kal...@li... >> https://lists.sourceforge.net/lists/listinfo/kaldi-developers >> > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers |
|
From: Chao W. <cw...@gm...> - 2013-11-13 14:19:35
|
Hi, You can easily do it now with the Kaldi by treating shared hidden layers as the feature transform. Don't think it's necessary to add the corresponding module for it. Bests, Chao On Mon, Nov 11, 2013 at 10:07 AM, 雪莲 <amy...@16...> wrote: > Dear sir, > Recently, Microsoft published a paper named "cross-language > knowledge transfer using multi-lingual deep neural network with shared > hidden layers". It's very useful. Maybe you could build a shared layer DNN > tool or module for multi-lingual recognition? That's a suggestion for > making Kaldi a better toolkit. If you planning on doing it, please let me > know. love kaldi! > best wishes! > > > Amy > > > > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > > |
|
From: Vassil P. <vas...@gm...> - 2013-11-13 14:03:21
|
By the way the 'trunk' version of Kaldi is using: wget -T 10 -t 3 http://merlin.fit.vutbr.cz/kaldi/sph2pipe_v2.5.tar.gz (just checked and seems to work) Vassil On Tue, Nov 12, 2013 at 4:09 PM, Rahil Mahdian <mah...@gm...> wrote: > Dear Sir/Madam, > > I am installing Kaldi but I have been stuck in a place: > > $ wget ftp://ftp.ldc.upenn.edu/pub/ldc/misc_sw/sph2pipe_v2.5.tar.gz > > then in ... ==> PSAV . couldn't connect to 128.91.252.156 port 65373: > Connection timed out > Retrying. > > What should I do? > > Regards, > Rahil Mahdian > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > |
|
From: Nagendra G. <nag...@go...> - 2013-11-13 13:11:18
|
Please looks at kaldi.sf.net in the data preparation section. On Nov 13, 2013 7:35 AM, "Disha Kaur Phull" <dk...@gm...> wrote: > > > ---------- Forwarded message ---------- > From: Disha Kaur Phull <dk...@gm...> > Date: Tue, Nov 12, 2013 at 10:22 AM > Subject: Regarding Working of KALDI > To: kal...@so... > > > > I am Disha Kaur a research Scholar from VIT University. I am doing my > research in the field of Speech Recognition. > I am trying to work with the KALDI toolkit. I was able to run the demo > example given in rm, s4(This only worked for me). > I want to give my own data to it but was not able to follow with it and > getting errors can you guide me with any documentation or steps that would > help me learn this tool better. > > My Contact Information: > > Email ID: dk...@gm..., dis...@vi... > > -- > With Regards, > > Disha Kaur Phull > Research Scholar > VIT University > Chennai Campus > > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > > |
|
From: Nagendra G. <nag...@go...> - 2013-11-13 13:07:16
|
Check firewall. Try from a different network. On Nov 13, 2013 7:35 AM, "Rahil Mahdian" <mah...@gm...> wrote: > Dear Sir/Madam, > > I am installing Kaldi but I have been stuck in a place: > > $ wget ftp://ftp.ldc.upenn.edu/pub/ldc/misc_sw/sph2pipe_v2.5.tar.gz > > then in ... ==> PSAV . couldn't connect to 128.91.252.156 port 65373: > Connection timed out > Retrying. > > What should I do? > > Regards, > Rahil Mahdian > > > ------------------------------------------------------------------------------ > DreamFactory - Open Source REST & JSON Services for HTML5 & Native Apps > OAuth, Users, Roles, SQL, NoSQL, BLOB Storage and External API Access > Free app hosting. Or install the open source package on any LAMP server. > Sign up and see examples for AngularJS, jQuery, Sencha Touch and Native! > http://pubads.g.doubleclick.net/gampad/clk?id=63469471&iu=/4140/ostg.clktrk > _______________________________________________ > Kaldi-developers mailing list > Kal...@li... > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > > |
|
From: Rahil M. <mah...@gm...> - 2013-11-12 14:09:31
|
Dear Sir/Madam, I am installing Kaldi but I have been stuck in a place: $ wget ftp://ftp.ldc.upenn.edu/pub/ldc/misc_sw/sph2pipe_v2.5.tar.gz then in ... ==> PSAV . couldn't connect to 128.91.252.156 port 65373: Connection timed out Retrying. What should I do? Regards, Rahil Mahdian |
|
From: Disha K. P. <dk...@gm...> - 2013-11-12 05:09:31
|
---------- Forwarded message ---------- From: Disha Kaur Phull <dk...@gm...> Date: Tue, Nov 12, 2013 at 10:22 AM Subject: Regarding Working of KALDI To: kal...@so... I am Disha Kaur a research Scholar from VIT University. I am doing my research in the field of Speech Recognition. I am trying to work with the KALDI toolkit. I was able to run the demo example given in rm, s4(This only worked for me). I want to give my own data to it but was not able to follow with it and getting errors can you guide me with any documentation or steps that would help me learn this tool better. My Contact Information: Email ID: dk...@gm..., dis...@vi... -- With Regards, Disha Kaur Phull Research Scholar VIT University Chennai Campus |
|
From: 雪莲 <amy...@16...> - 2013-11-11 15:07:47
|
Dear sir,
Recently, Microsoft published a paper named "cross-language knowledge transfer using multi-lingual deep neural network with shared hidden layers". It's very useful. Maybe you could build a shared layer DNN tool or module for multi-lingual recognition? That's a suggestion for making Kaldi a better toolkit. If you planning on doing it, please let me know.love kaldi!
best wishes!
Amy |
|
From: Daniel P. <dp...@gm...> - 2013-11-01 15:39:09
|
Great, thanks!
Dan
On Fri, Nov 1, 2013 at 8:05 AM, Ho Yin Chan <ric...@gm...> wrote:
> Yes, it does. There are some other places in the source code which required
> changes to in order to support C++11 compatiability.
>
> I just commited a version which I have tested with GCC4.4 (w/o C++11) and
> GCC4.7 (with and w/o -std=c++11 flag).
>
> A patch will need to solve the openfst parenthese issue when C++11
> compilation flag seen.
>
> Ricky
>
> On 2013/11/1 上午1:09, "Daniel Povey" <dp...@gm...> wrote:
>>
>> Could you please try
>> std::pair<typename MapType::iterator, bool> pr =
>> map_.insert(typename MapType::value_type(cur_key_, holder_));
>> which I think has a better chance of being back compatible?
>> Dan
>>
>>
>> On Thu, Oct 31, 2013 at 1:01 PM, Ho Yin Chan <ric...@gm...>
>> wrote:
>> > Hi Dan,
>> >
>> > The patch from Marcin (std::make_pair) does pass my g++ (GCC) 4.4.7
>> > compiler
>> > and run fine with Kaldi "make test". Yet, I can't tell if it works on
>> > others version. Regarding c++11, I think I need to update my compiler
>> > first
>> > to gcc 4.7 first before anything can be figure out.
>> >
>> > Ricky
>> >
>> >
>> >
>> > On Thu, Oct 31, 2013 at 11:33 PM, Daniel Povey <dp...@gm...> wrote:
>> >>
>> >> Actually, on second thoughts, I think we can apply the Kaldi fix, just
>> >> with an #ifdef.
>> >> Ricky, for the fix below regarding std::make_pair, do you think you
>> >> could figure out what the #ifdef we need to detect c++11 is, and put a
>> >> fix inside an #ifdef?
>> >> Dan
>> >>
>> >>
>> >> On Thu, Oct 31, 2013 at 11:32 AM, Daniel Povey <dp...@gm...>
>> >> wrote:
>> >> > Thanks for the info.
>> >> > Keywords for internet search: kaldi openfst c++11 compilation.
>> >> > I'm quite surprised that those parentheses are necessary in OpenFst--
>> >> > surely when transitioning to c++11 they wouldn't change operator
>> >> > precedence (??!!)
>> >> > Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
>> >> >
>> >> > I don't think I can apply the patch to Kaldi, because with that
>> >> > change
>> >> > it wouldn't compile in regular c++ (unless you tested it and found
>> >> > that it did). I think I put the template arguments to std::make_pair
>> >> > because it woudln't compile without them, otherwise I would never do
>> >> > that.
>> >> > Dan
>> >> >
>> >> >
>> >> > On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
>> >> >> ________________________________
>> >> >>
>> >> >> [bugs:#8] C++11 compatibility
>> >> >>
>> >> >> Status: open
>> >> >> Labels: c++11
>> >> >> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
>> >> >> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
>> >> >> Owner: nobody
>> >> >>
>> >> >> Kaldi does not compile with -std=c++11 flag
>> >> >>
>> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> >> from asr-server.cpp:20:
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
>> >> >> 'bool
>> >> >>
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> >> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
>> >> >> std::basic_string<char>;
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> >> std::basic_string<char>]':
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> >> 'bool
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> >> string&) [with Holder = kaldi::TokenHolder; std::string =
>> >> >> std::basic_string<char>]'
>> >> >> asr-server.cpp:842:1: required from here
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
>> >> >> matching
>> >> >> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
>> >> >> map_.insert(std::make_pair<std::string,
>> >> >> Holder*>(cur_key_,holder_));
>> >> >>
>> >> >> ^
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> >> is:
>> >> >> In file included from
>> >> >> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> >> from /usr/include/c++/4.8.1/ios:40,
>> >> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> >> from asr-server.cpp:3:
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
>> >> >> _T1,
>> >> >> class _T2> constexpr std::pair<typename
>> >> >> std::__decay_and_strip<_Tp>::__type,
>> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> >> _T2&&)
>> >> >> make_pair(_T1&& __x, _T2&& __y)
>> >> >> ^
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
>> >> >> argument
>> >> >> deduction/substitution failed:
>> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> >> from asr-server.cpp:20:
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> >> convert
>> >> >>
>> >> >>
>> >> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
>> >> >> (type 'std::string {aka std::basic_string<char>}') to type
>> >> >> 'std::basic_string<char>&&'
>> >> >> map_.insert(std::make_pair<std::string,
>> >> >> Holder*>(cur_key_,holder_));
>> >> >>
>> >> >> ^
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
>> >> >> 'bool
>> >> >>
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> >> string&, const T**) [with Holder =
>> >> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
>> >> >> std::basic_string<char>;
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> >> kaldi::Vector<float>]':
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> >> 'bool
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> >> string&) [with Holder =
>> >> >> kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >> >> >;
>> >> >> std::string = std::basic_string<char>]'
>> >> >> asr-server.cpp:842:1: required from here
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
>> >> >> matching
>> >> >> function for call to 'make_pair(std::string&,
>> >> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> >> is:
>> >> >> In file included from
>> >> >> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> >> from /usr/include/c++/4.8.1/ios:40,
>> >> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> >> from asr-server.cpp:3:
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
>> >> >> _T1,
>> >> >> class _T2> constexpr std::pair<typename
>> >> >> std::__decay_and_strip<_Tp>::__type,
>> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> >> _T2&&)
>> >> >> make_pair(_T1&& __x, _T2&& __y)
>> >> >> ^
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
>> >> >> argument
>> >> >> deduction/substitution failed:
>> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> >> from asr-server.cpp:20:
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> >> convert
>> >> >>
>> >> >>
>> >> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >> >>>
>> >>
>> >> >>>
>> >> >>> >>> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >> >>>
>> >>
>> >> >>>
>> >> >>> >>> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >> >>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to
>> >> >>> > type
>> >> >> 'std::basic_string<char>&&'
>> >> >> map_.insert(std::make_pair<std::string,
>> >> >> Holder*>(cur_key_,holder_));
>> >> >>
>> >> >> ^
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
>> >> >> 'bool
>> >> >>
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> >> string&, const T**) [with Holder =
>> >> >> kaldi::BasicVectorVectorHolder<int>;
>> >> >> std::string = std::basic_string<char>;
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> >> std::vector<std::vector<int> >]':
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> >> 'bool
>> >> >>
>> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> >> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>;
>> >> >> std::string =
>> >> >> std::basic_string<char>]'
>> >> >> asr-server.cpp:842:1: required from here
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
>> >> >> matching
>> >> >> function for call to 'make_pair(std::string&,
>> >> >> kaldi::BasicVectorVectorHolder<int>*&)'
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> >> is:
>> >> >> In file included from
>> >> >> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> >> from /usr/include/c++/4.8.1/ios:40,
>> >> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> >> from asr-server.cpp:3:
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
>> >> >> _T1,
>> >> >> class _T2> constexpr std::pair<typename
>> >> >> std::__decay_and_strip<_Tp>::__type,
>> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> >> _T2&&)
>> >> >> make_pair(_T1&& __x, _T2&& __y) </code>
>> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
>> >> >> argument
>> >> >> deduction/substitution failed:
>> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> >> from asr-server.cpp:20:
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> >> convert
>> >> >>
>> >> >>
>> >> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>> >>
>> >> >>>
>> >> >>> >>> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>> >>
>> >> >>>
>> >> >>> >>> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
>> >> >>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to
>> >> >>> type
>> >> >> 'std::basic_string<char>&&'
>> >> >> map_.insert(std::make_pair<std::string,
>> >> >> Holder*>(cur_key_,holder_));
>> >> >>
>> >> >> fix:
>> >> >>
>> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31
>> >> >> 15:22:23.569000000
>> >> >> +0100
>> >> >>
>> >> >> @@ -1992,7 +1990,8 @@
>> >> >> // of the object in holder_ to map_.
>> >> >> // Insert it into map_.
>> >> >> std::pair<typename MapType::iterator, bool> pr =
>> >> >> - map_.insert(std::make_pair<const std::string,
>> >> >> Holder*>(cur_key_,
>> >> >> -
>> >> >> holder_));
>> >> >> + map_.insert(std::make_pair(cur_key_,holder_));
>> >> >> if (!pr.second) { // Was not inserted-- previous element
>> >> >> w/
>> >> >> same
>> >> >> key
>> >> >> delete holder_; // map was not changed, no ownership
>> >> >> transferred.
>> >> >> KALDI_ERR << "Error in RandomAccessTableReader: duplicate
>> >> >> key "
>> >> >>
>> >> >> also, openfst does not compile with -std=c++11 flag (template
>> >> >> argument
>> >> >> deduction/substitution failed), fix:
>> >> >>
>> >> >> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h
>> >> >> 2013-10-31
>> >> >> 15:02:51.723000000 +0100
>> >> >>
>> >> >> @@ -218,7 +218,7 @@
>> >> >> interval.end = min(it1->end, it2->end);
>> >> >> ointervals->push_back(interval);
>> >> >> oset->count_ += interval.end - interval.begin;
>> >> >> - if (it1->end < it2->end)
>> >> >> + if ((it1->end) < (it2->end))
>> >> >> ++it1;
>> >> >> else
>> >> >> ++it2;
>> >> >> @@ -240,14 +240,14 @@
>> >> >> it != intervals_.end();
>> >> >> ++it) {
>> >> >> interval.end = min(it->begin, maxval);
>> >> >> - if (interval.begin < interval.end) {
>> >> >> + if ((interval.begin) < (interval.end)) {
>> >> >> ointervals->push_back(interval);
>> >> >> oset->count_ += interval.end - interval.begin;
>> >> >> }
>> >> >> interval.begin = it->end;
>> >> >> }
>> >> >> interval.end = maxval;
>> >> >> - if (interval.begin < interval.end) {
>> >> >> + if ((interval.begin) < (interval.end)) {
>> >> >> ointervals->push_back(interval);
>> >> >> oset->count_ += interval.end - interval.begin;
>> >> >> }
>> >> >> @@ -348,7 +348,7 @@
>> >> >> while (it1 != intervals_.end() && it2 != intervals->end()) {
>> >> >> if (it1->end <= it2->begin) { // no overlap - it1 first
>> >> >> ++it1;
>> >> >> - } else if (it2->begin < it1->begin || it2->end > it1->end) {
>> >> >> //
>> >> >> no C
>> >> >> + } else if ((it2->begin) < (it1->begin) || (it2->end) >
>> >> >> (it1->end))
>> >> >> {
>> >> >> // no C
>> >> >> return false;
>> >> >> } else if (it2->end == it1->end) {
>> >> >> ++it1;
>> >> >>
>> >> >> Marcin
>> >> >>
>> >> >> ________________________________
>> >> >>
>> >> >> Sent from sourceforge.net because you indicated interest in
>> >> >> https://sourceforge.net/p/kaldi/bugs/8/
>> >> >>
>> >> >> To unsubscribe from further messages, please visit
>> >> >> https://sourceforge.net/auth/subscriptions/
>> >
>> >
|
|
From: Ho Y. C. <ric...@gm...> - 2013-11-01 12:05:59
|
Yes, it does. There are some other places in the source code which required
changes to in order to support C++11 compatiability.
I just commited a version which I have tested with GCC4.4 (w/o C++11) and
GCC4.7 (with and w/o -std=c++11 flag).
A patch will need to solve the openfst parenthese issue when C++11
compilation flag seen.
Ricky
On 2013/11/1 上午1:09, "Daniel Povey" <dp...@gm...> wrote:
> Could you please try
> std::pair<typename MapType::iterator, bool> pr =
> map_.insert(typename MapType::value_type(cur_key_, holder_));
> which I think has a better chance of being back compatible?
> Dan
>
>
> On Thu, Oct 31, 2013 at 1:01 PM, Ho Yin Chan <ric...@gm...>
> wrote:
> > Hi Dan,
> >
> > The patch from Marcin (std::make_pair) does pass my g++ (GCC) 4.4.7
> compiler
> > and run fine with Kaldi "make test". Yet, I can't tell if it works on
> > others version. Regarding c++11, I think I need to update my compiler
> first
> > to gcc 4.7 first before anything can be figure out.
> >
> > Ricky
> >
> >
> >
> > On Thu, Oct 31, 2013 at 11:33 PM, Daniel Povey <dp...@gm...> wrote:
> >>
> >> Actually, on second thoughts, I think we can apply the Kaldi fix, just
> >> with an #ifdef.
> >> Ricky, for the fix below regarding std::make_pair, do you think you
> >> could figure out what the #ifdef we need to detect c++11 is, and put a
> >> fix inside an #ifdef?
> >> Dan
> >>
> >>
> >> On Thu, Oct 31, 2013 at 11:32 AM, Daniel Povey <dp...@gm...>
> wrote:
> >> > Thanks for the info.
> >> > Keywords for internet search: kaldi openfst c++11 compilation.
> >> > I'm quite surprised that those parentheses are necessary in OpenFst--
> >> > surely when transitioning to c++11 they wouldn't change operator
> >> > precedence (??!!)
> >> > Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
> >> >
> >> > I don't think I can apply the patch to Kaldi, because with that change
> >> > it wouldn't compile in regular c++ (unless you tested it and found
> >> > that it did). I think I put the template arguments to std::make_pair
> >> > because it woudln't compile without them, otherwise I would never do
> >> > that.
> >> > Dan
> >> >
> >> >
> >> > On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
> >> >> ________________________________
> >> >>
> >> >> [bugs:#8] C++11 compatibility
> >> >>
> >> >> Status: open
> >> >> Labels: c++11
> >> >> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
> >> >> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
> >> >> Owner: nobody
> >> >>
> >> >> Kaldi does not compile with -std=c++11 flag
> >> >>
> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> >> from asr-server.cpp:20:
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
> 'bool
> >> >>
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> >> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
> >> >> std::basic_string<char>;
> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> >> std::basic_string<char>]':
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> >> >> 'bool
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> >> string&) [with Holder = kaldi::TokenHolder; std::string =
> >> >> std::basic_string<char>]'
> >> >> asr-server.cpp:842:1: required from here
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
> matching
> >> >> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
> >> >> map_.insert(std::make_pair<std::string,
> >> >> Holder*>(cur_key_,holder_));
> >> >>
> >> >> ^
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
> >> >> is:
> >> >> In file included from
> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> >> from /usr/include/c++/4.8.1/ios:40,
> >> >> from /usr/include/c++/4.8.1/ostream:38,
> >> >> from /usr/include/c++/4.8.1/iostream:39,
> >> >> from asr-server.cpp:3:
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
> _T1,
> >> >> class _T2> constexpr std::pair<typename
> >> >> std::__decay_and_strip<_Tp>::__type,
> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> >> >> _T2&&)
> >> >> make_pair(_T1&& __x, _T2&& __y)
> >> >> ^
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
> argument
> >> >> deduction/substitution failed:
> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> >> from asr-server.cpp:20:
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> >> >> convert
> >> >>
> >> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
> >> >> (type 'std::string {aka std::basic_string<char>}') to type
> >> >> 'std::basic_string<char>&&'
> >> >> map_.insert(std::make_pair<std::string,
> >> >> Holder*>(cur_key_,holder_));
> >> >>
> >> >> ^
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
> 'bool
> >> >>
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> >> string&, const T**) [with Holder =
> >> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
> >> >> std::basic_string<char>;
> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> >> kaldi::Vector<float>]':
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> >> >> 'bool
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> >> string&) [with Holder = kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >> >> >;
> >> >> std::string = std::basic_string<char>]'
> >> >> asr-server.cpp:842:1: required from here
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
> matching
> >> >> function for call to 'make_pair(std::string&,
> >> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
> >> >> is:
> >> >> In file included from
> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> >> from /usr/include/c++/4.8.1/ios:40,
> >> >> from /usr/include/c++/4.8.1/ostream:38,
> >> >> from /usr/include/c++/4.8.1/iostream:39,
> >> >> from asr-server.cpp:3:
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
> _T1,
> >> >> class _T2> constexpr std::pair<typename
> >> >> std::__decay_and_strip<_Tp>::__type,
> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> >> >> _T2&&)
> >> >> make_pair(_T1&& __x, _T2&& __y)
> >> >> ^
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
> argument
> >> >> deduction/substitution failed:
> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> >> from asr-server.cpp:20:
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> >> >> convert
> >> >>
> >> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >> >>>
> >>
> >> >>>
> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >> >>>
> >>
> >> >>>
> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >> >>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to
> >> >>> > type
> >> >> 'std::basic_string<char>&&'
> >> >> map_.insert(std::make_pair<std::string,
> >> >> Holder*>(cur_key_,holder_));
> >> >>
> >> >> ^
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of
> 'bool
> >> >>
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> >> string&, const T**) [with Holder =
> kaldi::BasicVectorVectorHolder<int>;
> >> >> std::string = std::basic_string<char>;
> >> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> >> std::vector<std::vector<int> >]':
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> >> >> 'bool
> >> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> >> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>;
> >> >> std::string =
> >> >> std::basic_string<char>]'
> >> >> asr-server.cpp:842:1: required from here
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no
> matching
> >> >> function for call to 'make_pair(std::string&,
> >> >> kaldi::BasicVectorVectorHolder<int>*&)'
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
> >> >> is:
> >> >> In file included from
> /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> >> from /usr/include/c++/4.8.1/ios:40,
> >> >> from /usr/include/c++/4.8.1/ostream:38,
> >> >> from /usr/include/c++/4.8.1/iostream:39,
> >> >> from asr-server.cpp:3:
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class
> _T1,
> >> >> class _T2> constexpr std::pair<typename
> >> >> std::__decay_and_strip<_Tp>::__type,
> >> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> >> >> _T2&&)
> >> >> make_pair(_T1&& __x, _T2&& __y) </code>
> >> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template
> argument
> >> >> deduction/substitution failed:
> >> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> >> from asr-server.cpp:20:
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> >> >> convert
> >> >>
> >> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
> >>
> >> >>>
> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
> >>
> >> >>>
> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
> >> >>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to
> type
> >> >> 'std::basic_string<char>&&'
> >> >> map_.insert(std::make_pair<std::string,
> >> >> Holder*>(cur_key_,holder_));
> >> >>
> >> >> fix:
> >> >>
> >> >> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31
> >> >> 15:22:23.569000000
> >> >> +0100
> >> >>
> >> >> @@ -1992,7 +1990,8 @@
> >> >> // of the object in holder_ to map_.
> >> >> // Insert it into map_.
> >> >> std::pair<typename MapType::iterator, bool> pr =
> >> >> - map_.insert(std::make_pair<const std::string,
> >> >> Holder*>(cur_key_,
> >> >> -
> >> >> holder_));
> >> >> + map_.insert(std::make_pair(cur_key_,holder_));
> >> >> if (!pr.second) { // Was not inserted-- previous element w/
> >> >> same
> >> >> key
> >> >> delete holder_; // map was not changed, no ownership
> >> >> transferred.
> >> >> KALDI_ERR << "Error in RandomAccessTableReader: duplicate
> >> >> key "
> >> >>
> >> >> also, openfst does not compile with -std=c++11 flag (template
> argument
> >> >> deduction/substitution failed), fix:
> >> >>
> >> >> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h
> 2013-10-31
> >> >> 15:02:51.723000000 +0100
> >> >>
> >> >> @@ -218,7 +218,7 @@
> >> >> interval.end = min(it1->end, it2->end);
> >> >> ointervals->push_back(interval);
> >> >> oset->count_ += interval.end - interval.begin;
> >> >> - if (it1->end < it2->end)
> >> >> + if ((it1->end) < (it2->end))
> >> >> ++it1;
> >> >> else
> >> >> ++it2;
> >> >> @@ -240,14 +240,14 @@
> >> >> it != intervals_.end();
> >> >> ++it) {
> >> >> interval.end = min(it->begin, maxval);
> >> >> - if (interval.begin < interval.end) {
> >> >> + if ((interval.begin) < (interval.end)) {
> >> >> ointervals->push_back(interval);
> >> >> oset->count_ += interval.end - interval.begin;
> >> >> }
> >> >> interval.begin = it->end;
> >> >> }
> >> >> interval.end = maxval;
> >> >> - if (interval.begin < interval.end) {
> >> >> + if ((interval.begin) < (interval.end)) {
> >> >> ointervals->push_back(interval);
> >> >> oset->count_ += interval.end - interval.begin;
> >> >> }
> >> >> @@ -348,7 +348,7 @@
> >> >> while (it1 != intervals_.end() && it2 != intervals->end()) {
> >> >> if (it1->end <= it2->begin) { // no overlap - it1 first
> >> >> ++it1;
> >> >> - } else if (it2->begin < it1->begin || it2->end > it1->end) { //
> >> >> no C
> >> >> + } else if ((it2->begin) < (it1->begin) || (it2->end) >
> (it1->end))
> >> >> {
> >> >> // no C
> >> >> return false;
> >> >> } else if (it2->end == it1->end) {
> >> >> ++it1;
> >> >>
> >> >> Marcin
> >> >>
> >> >> ________________________________
> >> >>
> >> >> Sent from sourceforge.net because you indicated interest in
> >> >> https://sourceforge.net/p/kaldi/bugs/8/
> >> >>
> >> >> To unsubscribe from further messages, please visit
> >> >> https://sourceforge.net/auth/subscriptions/
> >
> >
>
|
|
From: Daniel P. <dp...@gm...> - 2013-10-31 17:09:26
|
Could you please try
std::pair<typename MapType::iterator, bool> pr =
map_.insert(typename MapType::value_type(cur_key_, holder_));
which I think has a better chance of being back compatible?
Dan
On Thu, Oct 31, 2013 at 1:01 PM, Ho Yin Chan <ric...@gm...> wrote:
> Hi Dan,
>
> The patch from Marcin (std::make_pair) does pass my g++ (GCC) 4.4.7 compiler
> and run fine with Kaldi "make test". Yet, I can't tell if it works on
> others version. Regarding c++11, I think I need to update my compiler first
> to gcc 4.7 first before anything can be figure out.
>
> Ricky
>
>
>
> On Thu, Oct 31, 2013 at 11:33 PM, Daniel Povey <dp...@gm...> wrote:
>>
>> Actually, on second thoughts, I think we can apply the Kaldi fix, just
>> with an #ifdef.
>> Ricky, for the fix below regarding std::make_pair, do you think you
>> could figure out what the #ifdef we need to detect c++11 is, and put a
>> fix inside an #ifdef?
>> Dan
>>
>>
>> On Thu, Oct 31, 2013 at 11:32 AM, Daniel Povey <dp...@gm...> wrote:
>> > Thanks for the info.
>> > Keywords for internet search: kaldi openfst c++11 compilation.
>> > I'm quite surprised that those parentheses are necessary in OpenFst--
>> > surely when transitioning to c++11 they wouldn't change operator
>> > precedence (??!!)
>> > Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
>> >
>> > I don't think I can apply the patch to Kaldi, because with that change
>> > it wouldn't compile in regular c++ (unless you tested it and found
>> > that it did). I think I put the template arguments to std::make_pair
>> > because it woudln't compile without them, otherwise I would never do
>> > that.
>> > Dan
>> >
>> >
>> > On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
>> >> ________________________________
>> >>
>> >> [bugs:#8] C++11 compatibility
>> >>
>> >> Status: open
>> >> Labels: c++11
>> >> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
>> >> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
>> >> Owner: nobody
>> >>
>> >> Kaldi does not compile with -std=c++11 flag
>> >>
>> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> from asr-server.cpp:20:
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> >>
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
>> >> std::basic_string<char>;
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> std::basic_string<char>]':
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> 'bool
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> string&) [with Holder = kaldi::TokenHolder; std::string =
>> >> std::basic_string<char>]'
>> >> asr-server.cpp:842:1: required from here
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> >> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
>> >> map_.insert(std::make_pair<std::string,
>> >> Holder*>(cur_key_,holder_));
>> >>
>> >> ^
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> is:
>> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> from /usr/include/c++/4.8.1/ios:40,
>> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> from asr-server.cpp:3:
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> >> class _T2> constexpr std::pair<typename
>> >> std::__decay_and_strip<_Tp>::__type,
>> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> _T2&&)
>> >> make_pair(_T1&& __x, _T2&& __y)
>> >> ^
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> >> deduction/substitution failed:
>> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> from asr-server.cpp:20:
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> convert
>> >>
>> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
>> >> (type 'std::string {aka std::basic_string<char>}') to type
>> >> 'std::basic_string<char>&&'
>> >> map_.insert(std::make_pair<std::string,
>> >> Holder*>(cur_key_,holder_));
>> >>
>> >> ^
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> >>
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> string&, const T**) [with Holder =
>> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
>> >> std::basic_string<char>;
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> kaldi::Vector<float>]':
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> 'bool
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> string&) [with Holder = kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >> >;
>> >> std::string = std::basic_string<char>]'
>> >> asr-server.cpp:842:1: required from here
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> >> function for call to 'make_pair(std::string&,
>> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> is:
>> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> from /usr/include/c++/4.8.1/ios:40,
>> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> from asr-server.cpp:3:
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> >> class _T2> constexpr std::pair<typename
>> >> std::__decay_and_strip<_Tp>::__type,
>> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> _T2&&)
>> >> make_pair(_T1&& __x, _T2&& __y)
>> >> ^
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> >> deduction/substitution failed:
>> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> from asr-server.cpp:20:
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> convert
>> >>
>> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >>>
>>
>> >>> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >>>
>>
>> >>> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to
>> >>> > type
>> >> 'std::basic_string<char>&&'
>> >> map_.insert(std::make_pair<std::string,
>> >> Holder*>(cur_key_,holder_));
>> >>
>> >> ^
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> >>
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> >> string&, const T**) [with Holder = kaldi::BasicVectorVectorHolder<int>;
>> >> std::string = std::basic_string<char>;
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> >> std::vector<std::vector<int> >]':
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
>> >> 'bool
>> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> >> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>;
>> >> std::string =
>> >> std::basic_string<char>]'
>> >> asr-server.cpp:842:1: required from here
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> >> function for call to 'make_pair(std::string&,
>> >> kaldi::BasicVectorVectorHolder<int>*&)'
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate
>> >> is:
>> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> >> from /usr/include/c++/4.8.1/ios:40,
>> >> from /usr/include/c++/4.8.1/ostream:38,
>> >> from /usr/include/c++/4.8.1/iostream:39,
>> >> from asr-server.cpp:3:
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> >> class _T2> constexpr std::pair<typename
>> >> std::__decay_and_strip<_Tp>::__type,
>> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
>> >> _T2&&)
>> >> make_pair(_T1&& __x, _T2&& __y) </code>
>> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> >> deduction/substitution failed:
>> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> >> from ../../kaldi-3123/src/util/table-types.h:24,
>> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> >> from asr-server.cpp:20:
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
>> >> convert
>> >>
>> >> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>
>> >>> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>
>> >>> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
>> >>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
>> >> 'std::basic_string<char>&&'
>> >> map_.insert(std::make_pair<std::string,
>> >> Holder*>(cur_key_,holder_));
>> >>
>> >> fix:
>> >>
>> >> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31
>> >> 15:22:23.569000000
>> >> +0100
>> >>
>> >> @@ -1992,7 +1990,8 @@
>> >> // of the object in holder_ to map_.
>> >> // Insert it into map_.
>> >> std::pair<typename MapType::iterator, bool> pr =
>> >> - map_.insert(std::make_pair<const std::string,
>> >> Holder*>(cur_key_,
>> >> -
>> >> holder_));
>> >> + map_.insert(std::make_pair(cur_key_,holder_));
>> >> if (!pr.second) { // Was not inserted-- previous element w/
>> >> same
>> >> key
>> >> delete holder_; // map was not changed, no ownership
>> >> transferred.
>> >> KALDI_ERR << "Error in RandomAccessTableReader: duplicate
>> >> key "
>> >>
>> >> also, openfst does not compile with -std=c++11 flag (template argument
>> >> deduction/substitution failed), fix:
>> >>
>> >> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h 2013-10-31
>> >> 15:02:51.723000000 +0100
>> >>
>> >> @@ -218,7 +218,7 @@
>> >> interval.end = min(it1->end, it2->end);
>> >> ointervals->push_back(interval);
>> >> oset->count_ += interval.end - interval.begin;
>> >> - if (it1->end < it2->end)
>> >> + if ((it1->end) < (it2->end))
>> >> ++it1;
>> >> else
>> >> ++it2;
>> >> @@ -240,14 +240,14 @@
>> >> it != intervals_.end();
>> >> ++it) {
>> >> interval.end = min(it->begin, maxval);
>> >> - if (interval.begin < interval.end) {
>> >> + if ((interval.begin) < (interval.end)) {
>> >> ointervals->push_back(interval);
>> >> oset->count_ += interval.end - interval.begin;
>> >> }
>> >> interval.begin = it->end;
>> >> }
>> >> interval.end = maxval;
>> >> - if (interval.begin < interval.end) {
>> >> + if ((interval.begin) < (interval.end)) {
>> >> ointervals->push_back(interval);
>> >> oset->count_ += interval.end - interval.begin;
>> >> }
>> >> @@ -348,7 +348,7 @@
>> >> while (it1 != intervals_.end() && it2 != intervals->end()) {
>> >> if (it1->end <= it2->begin) { // no overlap - it1 first
>> >> ++it1;
>> >> - } else if (it2->begin < it1->begin || it2->end > it1->end) { //
>> >> no C
>> >> + } else if ((it2->begin) < (it1->begin) || (it2->end) > (it1->end))
>> >> {
>> >> // no C
>> >> return false;
>> >> } else if (it2->end == it1->end) {
>> >> ++it1;
>> >>
>> >> Marcin
>> >>
>> >> ________________________________
>> >>
>> >> Sent from sourceforge.net because you indicated interest in
>> >> https://sourceforge.net/p/kaldi/bugs/8/
>> >>
>> >> To unsubscribe from further messages, please visit
>> >> https://sourceforge.net/auth/subscriptions/
>
>
|
|
From: Ho Y. C. <ric...@gm...> - 2013-10-31 17:01:42
|
Hi Dan,
The patch from Marcin (std::make_pair) does pass my g++ (GCC) 4.4.7
compiler and run fine with Kaldi "make test". Yet, I can't tell if it
works on others version. Regarding c++11, I think I need to update my
compiler first to gcc 4.7 first before anything can be figure out.
Ricky
On Thu, Oct 31, 2013 at 11:33 PM, Daniel Povey <dp...@gm...> wrote:
> Actually, on second thoughts, I think we can apply the Kaldi fix, just
> with an #ifdef.
> Ricky, for the fix below regarding std::make_pair, do you think you
> could figure out what the #ifdef we need to detect c++11 is, and put a
> fix inside an #ifdef?
> Dan
>
>
> On Thu, Oct 31, 2013 at 11:32 AM, Daniel Povey <dp...@gm...> wrote:
> > Thanks for the info.
> > Keywords for internet search: kaldi openfst c++11 compilation.
> > I'm quite surprised that those parentheses are necessary in OpenFst--
> > surely when transitioning to c++11 they wouldn't change operator
> > precedence (??!!)
> > Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
> >
> > I don't think I can apply the patch to Kaldi, because with that change
> > it wouldn't compile in regular c++ (unless you tested it and found
> > that it did). I think I put the template arguments to std::make_pair
> > because it woudln't compile without them, otherwise I would never do
> > that.
> > Dan
> >
> >
> > On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
> >> ________________________________
> >>
> >> [bugs:#8] C++11 compatibility
> >>
> >> Status: open
> >> Labels: c++11
> >> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
> >> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
> >> Owner: nobody
> >>
> >> Kaldi does not compile with -std=c++11 flag
> >>
> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> from asr-server.cpp:20:
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
> >> std::basic_string<char>;
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> std::basic_string<char>]':
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> 'bool
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> string&) [with Holder = kaldi::TokenHolder; std::string =
> >> std::basic_string<char>]'
> >> asr-server.cpp:842:1: required from here
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> >> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
> >> map_.insert(std::make_pair<std::string,
> >> Holder*>(cur_key_,holder_));
> >>
> >> ^
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> from /usr/include/c++/4.8.1/ios:40,
> >> from /usr/include/c++/4.8.1/ostream:38,
> >> from /usr/include/c++/4.8.1/iostream:39,
> >> from asr-server.cpp:3:
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> >> class _T2> constexpr std::pair<typename
> std::__decay_and_strip<_Tp>::__type,
> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> _T2&&)
> >> make_pair(_T1&& __x, _T2&& __y)
> >> ^
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> >> deduction/substitution failed:
> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> from asr-server.cpp:20:
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> convert
> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
> >> (type 'std::string {aka std::basic_string<char>}') to type
> >> 'std::basic_string<char>&&'
> >> map_.insert(std::make_pair<std::string,
> >> Holder*>(cur_key_,holder_));
> >>
> >> ^
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> string&, const T**) [with Holder =
> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
> >> std::basic_string<char>;
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> kaldi::Vector<float>]':
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> 'bool
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> string&) [with Holder = kaldi::KaldiObjectHolder<kaldi::Vector<float> >;
> >> std::string = std::basic_string<char>]'
> >> asr-server.cpp:842:1: required from here
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> >> function for call to 'make_pair(std::string&,
> >> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> from /usr/include/c++/4.8.1/ios:40,
> >> from /usr/include/c++/4.8.1/ostream:38,
> >> from /usr/include/c++/4.8.1/iostream:39,
> >> from asr-server.cpp:3:
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> >> class _T2> constexpr std::pair<typename
> std::__decay_and_strip<_Tp>::__type,
> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> _T2&&)
> >> make_pair(_T1&& __x, _T2&& __y)
> >> ^
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> >> deduction/substitution failed:
> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> from asr-server.cpp:20:
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> convert
> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >>>
>
> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >>>
>
> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
> >>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
> >> 'std::basic_string<char>&&'
> >> map_.insert(std::make_pair<std::string,
> >> Holder*>(cur_key_,holder_));
> >>
> >> ^
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> >>
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> >> string&, const T**) [with Holder = kaldi::BasicVectorVectorHolder<int>;
> >> std::string = std::basic_string<char>;
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> >> std::vector<std::vector<int> >]':
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from
> 'bool
> >> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> >> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>;
> std::string =
> >> std::basic_string<char>]'
> >> asr-server.cpp:842:1: required from here
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> >> function for call to 'make_pair(std::string&,
> >> kaldi::BasicVectorVectorHolder<int>*&)'
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> >> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> >> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> >> from /usr/include/c++/4.8.1/ios:40,
> >> from /usr/include/c++/4.8.1/ostream:38,
> >> from /usr/include/c++/4.8.1/iostream:39,
> >> from asr-server.cpp:3:
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> >> class _T2> constexpr std::pair<typename
> std::__decay_and_strip<_Tp>::__type,
> >> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&,
> _T2&&)
> >> make_pair(_T1&& __x, _T2&& __y) </code>
> >> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> >> deduction/substitution failed:
> >> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> >> from ../../kaldi-3123/src/util/table-types.h:24,
> >> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> >> from asr-server.cpp:20:
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot
> convert
> >>
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>
> >>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>
> >>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
> >>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
> >> 'std::basic_string<char>&&'
> >> map_.insert(std::make_pair<std::string,
> >> Holder*>(cur_key_,holder_));
> >>
> >> fix:
> >>
> >> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31
> 15:22:23.569000000
> >> +0100
> >>
> >> @@ -1992,7 +1990,8 @@
> >> // of the object in holder_ to map_.
> >> // Insert it into map_.
> >> std::pair<typename MapType::iterator, bool> pr =
> >> - map_.insert(std::make_pair<const std::string,
> >> Holder*>(cur_key_,
> >> -
> >> holder_));
> >> + map_.insert(std::make_pair(cur_key_,holder_));
> >> if (!pr.second) { // Was not inserted-- previous element w/
> same
> >> key
> >> delete holder_; // map was not changed, no ownership
> >> transferred.
> >> KALDI_ERR << "Error in RandomAccessTableReader: duplicate
> key "
> >>
> >> also, openfst does not compile with -std=c++11 flag (template argument
> >> deduction/substitution failed), fix:
> >>
> >> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h 2013-10-31
> >> 15:02:51.723000000 +0100
> >>
> >> @@ -218,7 +218,7 @@
> >> interval.end = min(it1->end, it2->end);
> >> ointervals->push_back(interval);
> >> oset->count_ += interval.end - interval.begin;
> >> - if (it1->end < it2->end)
> >> + if ((it1->end) < (it2->end))
> >> ++it1;
> >> else
> >> ++it2;
> >> @@ -240,14 +240,14 @@
> >> it != intervals_.end();
> >> ++it) {
> >> interval.end = min(it->begin, maxval);
> >> - if (interval.begin < interval.end) {
> >> + if ((interval.begin) < (interval.end)) {
> >> ointervals->push_back(interval);
> >> oset->count_ += interval.end - interval.begin;
> >> }
> >> interval.begin = it->end;
> >> }
> >> interval.end = maxval;
> >> - if (interval.begin < interval.end) {
> >> + if ((interval.begin) < (interval.end)) {
> >> ointervals->push_back(interval);
> >> oset->count_ += interval.end - interval.begin;
> >> }
> >> @@ -348,7 +348,7 @@
> >> while (it1 != intervals_.end() && it2 != intervals->end()) {
> >> if (it1->end <= it2->begin) { // no overlap - it1 first
> >> ++it1;
> >> - } else if (it2->begin < it1->begin || it2->end > it1->end) { //
> no C
> >> + } else if ((it2->begin) < (it1->begin) || (it2->end) > (it1->end))
> {
> >> // no C
> >> return false;
> >> } else if (it2->end == it1->end) {
> >> ++it1;
> >>
> >> Marcin
> >>
> >> ________________________________
> >>
> >> Sent from sourceforge.net because you indicated interest in
> >> https://sourceforge.net/p/kaldi/bugs/8/
> >>
> >> To unsubscribe from further messages, please visit
> >> https://sourceforge.net/auth/subscriptions/
>
|
|
From: Daniel P. <dp...@gm...> - 2013-10-31 15:33:47
|
Actually, on second thoughts, I think we can apply the Kaldi fix, just
with an #ifdef.
Ricky, for the fix below regarding std::make_pair, do you think you
could figure out what the #ifdef we need to detect c++11 is, and put a
fix inside an #ifdef?
Dan
On Thu, Oct 31, 2013 at 11:32 AM, Daniel Povey <dp...@gm...> wrote:
> Thanks for the info.
> Keywords for internet search: kaldi openfst c++11 compilation.
> I'm quite surprised that those parentheses are necessary in OpenFst--
> surely when transitioning to c++11 they wouldn't change operator
> precedence (??!!)
> Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
>
> I don't think I can apply the patch to Kaldi, because with that change
> it wouldn't compile in regular c++ (unless you tested it and found
> that it did). I think I put the template arguments to std::make_pair
> because it woudln't compile without them, otherwise I would never do
> that.
> Dan
>
>
> On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
>> ________________________________
>>
>> [bugs:#8] C++11 compatibility
>>
>> Status: open
>> Labels: c++11
>> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
>> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
>> Owner: nobody
>>
>> Kaldi does not compile with -std=c++11 flag
>>
>> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> from ../../kaldi-3123/src/util/table-types.h:24,
>> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> from asr-server.cpp:20:
>> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
>> std::basic_string<char>;
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> std::basic_string<char>]':
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> string&) [with Holder = kaldi::TokenHolder; std::string =
>> std::basic_string<char>]'
>> asr-server.cpp:842:1: required from here
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
>> map_.insert(std::make_pair<std::string,
>> Holder*>(cur_key_,holder_));
>>
>> ^
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
>> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> from /usr/include/c++/4.8.1/ios:40,
>> from /usr/include/c++/4.8.1/ostream:38,
>> from /usr/include/c++/4.8.1/iostream:39,
>> from asr-server.cpp:3:
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
>> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
>> make_pair(_T1&& __x, _T2&& __y)
>> ^
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> deduction/substitution failed:
>> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> from ../../kaldi-3123/src/util/table-types.h:24,
>> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> from asr-server.cpp:20:
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
>> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
>> (type 'std::string {aka std::basic_string<char>}') to type
>> 'std::basic_string<char>&&'
>> map_.insert(std::make_pair<std::string,
>> Holder*>(cur_key_,holder_));
>>
>> ^
>> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> string&, const T**) [with Holder =
>> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
>> std::basic_string<char>;
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> kaldi::Vector<float>]':
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> string&) [with Holder = kaldi::KaldiObjectHolder<kaldi::Vector<float> >;
>> std::string = std::basic_string<char>]'
>> asr-server.cpp:842:1: required from here
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> function for call to 'make_pair(std::string&,
>> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
>> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> from /usr/include/c++/4.8.1/ios:40,
>> from /usr/include/c++/4.8.1/ostream:38,
>> from /usr/include/c++/4.8.1/iostream:39,
>> from asr-server.cpp:3:
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
>> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
>> make_pair(_T1&& __x, _T2&& __y)
>> ^
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> deduction/substitution failed:
>> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> from ../../kaldi-3123/src/util/table-types.h:24,
>> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> from asr-server.cpp:20:
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
>> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>>>
>>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>>>
>>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
>> 'std::basic_string<char>&&'
>> map_.insert(std::make_pair<std::string,
>> Holder*>(cur_key_,holder_));
>>
>> ^
>> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
>> string&, const T**) [with Holder = kaldi::BasicVectorVectorHolder<int>;
>> std::string = std::basic_string<char>;
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
>> std::vector<std::vector<int> >]':
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
>> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
>> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>; std::string =
>> std::basic_string<char>]'
>> asr-server.cpp:842:1: required from here
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
>> function for call to 'make_pair(std::string&,
>> kaldi::BasicVectorVectorHolder<int>*&)'
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
>> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
>> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
>> from /usr/include/c++/4.8.1/ios:40,
>> from /usr/include/c++/4.8.1/ostream:38,
>> from /usr/include/c++/4.8.1/iostream:39,
>> from asr-server.cpp:3:
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
>> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
>> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
>> make_pair(_T1&& __x, _T2&& __y) </code>
>> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
>> deduction/substitution failed:
>> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
>> from ../../kaldi-3123/src/util/table-types.h:24,
>> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
>> from asr-server.cpp:20:
>> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
>> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
>>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
>> 'std::basic_string<char>&&'
>> map_.insert(std::make_pair<std::string,
>> Holder*>(cur_key_,holder_));
>>
>> fix:
>>
>> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31 15:22:23.569000000
>> +0100
>>
>> @@ -1992,7 +1990,8 @@
>> // of the object in holder_ to map_.
>> // Insert it into map_.
>> std::pair<typename MapType::iterator, bool> pr =
>> - map_.insert(std::make_pair<const std::string,
>> Holder*>(cur_key_,
>> -
>> holder_));
>> + map_.insert(std::make_pair(cur_key_,holder_));
>> if (!pr.second) { // Was not inserted-- previous element w/ same
>> key
>> delete holder_; // map was not changed, no ownership
>> transferred.
>> KALDI_ERR << "Error in RandomAccessTableReader: duplicate key "
>>
>> also, openfst does not compile with -std=c++11 flag (template argument
>> deduction/substitution failed), fix:
>>
>> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h 2013-10-31
>> 15:02:51.723000000 +0100
>>
>> @@ -218,7 +218,7 @@
>> interval.end = min(it1->end, it2->end);
>> ointervals->push_back(interval);
>> oset->count_ += interval.end - interval.begin;
>> - if (it1->end < it2->end)
>> + if ((it1->end) < (it2->end))
>> ++it1;
>> else
>> ++it2;
>> @@ -240,14 +240,14 @@
>> it != intervals_.end();
>> ++it) {
>> interval.end = min(it->begin, maxval);
>> - if (interval.begin < interval.end) {
>> + if ((interval.begin) < (interval.end)) {
>> ointervals->push_back(interval);
>> oset->count_ += interval.end - interval.begin;
>> }
>> interval.begin = it->end;
>> }
>> interval.end = maxval;
>> - if (interval.begin < interval.end) {
>> + if ((interval.begin) < (interval.end)) {
>> ointervals->push_back(interval);
>> oset->count_ += interval.end - interval.begin;
>> }
>> @@ -348,7 +348,7 @@
>> while (it1 != intervals_.end() && it2 != intervals->end()) {
>> if (it1->end <= it2->begin) { // no overlap - it1 first
>> ++it1;
>> - } else if (it2->begin < it1->begin || it2->end > it1->end) { // no C
>> + } else if ((it2->begin) < (it1->begin) || (it2->end) > (it1->end)) {
>> // no C
>> return false;
>> } else if (it2->end == it1->end) {
>> ++it1;
>>
>> Marcin
>>
>> ________________________________
>>
>> Sent from sourceforge.net because you indicated interest in
>> https://sourceforge.net/p/kaldi/bugs/8/
>>
>> To unsubscribe from further messages, please visit
>> https://sourceforge.net/auth/subscriptions/
|
|
From: Daniel P. <dp...@gm...> - 2013-10-31 15:32:16
|
Thanks for the info.
Keywords for internet search: kaldi openfst c++11 compilation.
I'm quite surprised that those parentheses are necessary in OpenFst--
surely when transitioning to c++11 they wouldn't change operator
precedence (??!!)
Anyway, I'm cc'ing Mike Riley, regarding the OpenFst issues.
I don't think I can apply the patch to Kaldi, because with that change
it wouldn't compile in regular c++ (unless you tested it and found
that it did). I think I put the template arguments to std::make_pair
because it woudln't compile without them, otherwise I would never do
that.
Dan
On Thu, Oct 31, 2013 at 11:27 AM, tvarog <tv...@us...> wrote:
> ________________________________
>
> [bugs:#8] C++11 compatibility
>
> Status: open
> Labels: c++11
> Created: Thu Oct 31, 2013 03:27 PM UTC by tvarog
> Last Updated: Thu Oct 31, 2013 03:27 PM UTC
> Owner: nobody
>
> Kaldi does not compile with -std=c++11 flag
>
> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> from ../../kaldi-3123/src/util/table-types.h:24,
> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> from asr-server.cpp:20:
> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> string&, const T**) [with Holder = kaldi::TokenHolder; std::string =
> std::basic_string<char>;
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> std::basic_string<char>]':
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> string&) [with Holder = kaldi::TokenHolder; std::string =
> std::basic_string<char>]'
> asr-server.cpp:842:1: required from here
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> function for call to 'make_pair(std::string&, kaldi::TokenHolder*&)'
> map_.insert(std::make_pair<std::string,
> Holder*>(cur_key_,holder_));
>
> ^
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> from /usr/include/c++/4.8.1/ios:40,
> from /usr/include/c++/4.8.1/ostream:38,
> from /usr/include/c++/4.8.1/iostream:39,
> from asr-server.cpp:3:
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
> make_pair(_T1&& __x, _T2&& __y)
> ^
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> deduction/substitution failed:
> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> from ../../kaldi-3123/src/util/table-types.h:24,
> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> from asr-server.cpp:20:
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::TokenHolder>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::TokenHolder>::cur_key_'
> (type 'std::string {aka std::basic_string<char>}') to type
> 'std::basic_string<char>&&'
> map_.insert(std::make_pair<std::string,
> Holder*>(cur_key_,holder_));
>
> ^
> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> string&, const T**) [with Holder =
> kaldi::KaldiObjectHolder<kaldi::Vector<float> >; std::string =
> std::basic_string<char>;
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> kaldi::Vector<float>]':
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> string&) [with Holder = kaldi::KaldiObjectHolder<kaldi::Vector<float> >;
> std::string = std::basic_string<char>]'
> asr-server.cpp:842:1: required from here
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> function for call to 'make_pair(std::string&,
> kaldi::KaldiObjectHolder<kaldi::Vector<float> >*&)'
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> from /usr/include/c++/4.8.1/ios:40,
> from /usr/include/c++/4.8.1/ostream:38,
> from /usr/include/c++/4.8.1/iostream:39,
> from asr-server.cpp:3:
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
> make_pair(_T1&& __x, _T2&& __y)
> ^
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> deduction/substitution failed:
> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> from ../../kaldi-3123/src/util/table-types.h:24,
> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> from asr-server.cpp:20:
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>>
>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>>
>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::KaldiObjectHolder<kaldi::Vector<float>
>> >::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
> 'std::basic_string<char>&&'
> map_.insert(std::make_pair<std::string,
> Holder*>(cur_key_,holder_));
>
> ^
> ../../kaldi-3123/src/util/kaldi-table-inl.h: In instantiation of 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::FindKeyInternal(const
> string&, const T**) [with Holder = kaldi::BasicVectorVectorHolder<int>;
> std::string = std::basic_string<char>;
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::T =
> std::vector<std::vector<int> >]':
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1932:37: required from 'bool
> kaldi::RandomAccessTableReaderUnsortedArchiveImpl<Holder>::HasKey(const
> string&) [with Holder = kaldi::BasicVectorVectorHolder<int>; std::string =
> std::basic_string<char>]'
> asr-server.cpp:842:1: required from here
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: error: no matching
> function for call to 'make_pair(std::string&,
> kaldi::BasicVectorVectorHolder<int>*&)'
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: candidate is:
> In file included from /usr/include/c++/4.8.1/bits/stl_algobase.h:64:0,
> from /usr/include/c++/4.8.1/bits/char_traits.h:39,
> from /usr/include/c++/4.8.1/ios:40,
> from /usr/include/c++/4.8.1/ostream:38,
> from /usr/include/c++/4.8.1/iostream:39,
> from asr-server.cpp:3:
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template<class _T1,
> class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type,
> typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
> make_pair(_T1&& __x, _T2&& __y) </code>
> /usr/include/c++/4.8.1/bits/stl_pair.h:276:5: note: template argument
> deduction/substitution failed:
> In file included from ../../kaldi-3123/src/util/kaldi-table.h:426:0,
> from ../../kaldi-3123/src/util/table-types.h:24,
> from ../../kaldi-3123/src/sgmm2/am-sgmm2.h:35,
> from asr-server.cpp:20:
> ../../kaldi-3123/src/util/kaldi-table-inl.h:1995:78: note: cannot convert
> '((kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>*)this)->kaldi::RandomAccessTableReaderUnsortedArchiveImpl<kaldi::BasicVectorVectorHolder<int>
>>::<anonymous>.kaldi::RandomAccessTableReaderArchiveImplBase<kaldi::BasicVectorVectorHolder<int>
>>::cur_key_' (type 'std::string {aka std::basic_string<char>}') to type
> 'std::basic_string<char>&&'
> map_.insert(std::make_pair<std::string,
> Holder*>(cur_key_,holder_));
>
> fix:
>
> ../../kaldi-3123/src/util/kaldi-table-inl.h 2013-10-31 15:22:23.569000000
> +0100
>
> @@ -1992,7 +1990,8 @@
> // of the object in holder_ to map_.
> // Insert it into map_.
> std::pair<typename MapType::iterator, bool> pr =
> - map_.insert(std::make_pair<const std::string,
> Holder*>(cur_key_,
> -
> holder_));
> + map_.insert(std::make_pair(cur_key_,holder_));
> if (!pr.second) { // Was not inserted-- previous element w/ same
> key
> delete holder_; // map was not changed, no ownership
> transferred.
> KALDI_ERR << "Error in RandomAccessTableReader: duplicate key "
>
> also, openfst does not compile with -std=c++11 flag (template argument
> deduction/substitution failed), fix:
>
> ../../kaldi-3123/tools/openfst/include/fst/interval-set.h 2013-10-31
> 15:02:51.723000000 +0100
>
> @@ -218,7 +218,7 @@
> interval.end = min(it1->end, it2->end);
> ointervals->push_back(interval);
> oset->count_ += interval.end - interval.begin;
> - if (it1->end < it2->end)
> + if ((it1->end) < (it2->end))
> ++it1;
> else
> ++it2;
> @@ -240,14 +240,14 @@
> it != intervals_.end();
> ++it) {
> interval.end = min(it->begin, maxval);
> - if (interval.begin < interval.end) {
> + if ((interval.begin) < (interval.end)) {
> ointervals->push_back(interval);
> oset->count_ += interval.end - interval.begin;
> }
> interval.begin = it->end;
> }
> interval.end = maxval;
> - if (interval.begin < interval.end) {
> + if ((interval.begin) < (interval.end)) {
> ointervals->push_back(interval);
> oset->count_ += interval.end - interval.begin;
> }
> @@ -348,7 +348,7 @@
> while (it1 != intervals_.end() && it2 != intervals->end()) {
> if (it1->end <= it2->begin) { // no overlap - it1 first
> ++it1;
> - } else if (it2->begin < it1->begin || it2->end > it1->end) { // no C
> + } else if ((it2->begin) < (it1->begin) || (it2->end) > (it1->end)) {
> // no C
> return false;
> } else if (it2->end == it1->end) {
> ++it1;
>
> Marcin
>
> ________________________________
>
> Sent from sourceforge.net because you indicated interest in
> https://sourceforge.net/p/kaldi/bugs/8/
>
> To unsubscribe from further messages, please visit
> https://sourceforge.net/auth/subscriptions/
|
|
From: Arif K. <ife...@gm...> - 2013-10-29 16:46:29
|
Thanks a lot Daniel. :) Best regards, Arif On Tue, Oct 29, 2013 at 5:41 PM, Daniel Povey <dp...@gm...> wrote: > There are no maximums, but generally it won't pay to make it more than > 10,000 regardless how much data you have. > Dan > > > On Tue, Oct 29, 2013 at 12:35 PM, Arif Khan <ife...@gm...> wrote: > > Thank you very much Daniel for such a detail answer. > > > > One more question in this regard, > > > > Do we have a maximum limit specially for No. of leafes, if we add more > > corpus for training like WSJ than TIDIGITS or WSJ than Air traffic data. > > > > Best regards, > > Arif > > > > > > > > On Tue, Oct 29, 2013 at 5:06 PM, Daniel Povey <dp...@gm...> wrote: > >> > >> The number of leaves should decrease as you decrease the data, but > >> less than proportionally (e.g. 1/10 the data -> 1/4 the number of > >> leaves). > >> The number of Gaussians per leaf, which is the ratio of tot-num-gauss > >> to num-leaves, should decrease as you decrease the data, e.g. 1/10 the > >> data -> maybe 1/2 the average number of Gaussians per leaf. The total > >> number of Gaussians should decrease in a > >> slightly-less-than-proportional way as you decrease the amount of > >> data. > >> > >> Dan > >> > >> > >> On Tue, Oct 29, 2013 at 12:04 PM, Arif Khan <ife...@gm...> > wrote: > >> > Thanks Daniel. > >> > > >> > Do we have any fixed rule, or it is just trying different combinations > >> > and > >> > see the results. > >> > Are the No. of leaves and No. of Gaussian dependent on each other OR > >> > they > >> > are independent means one can change either of them in any > proportions. > >> > > >> > > >> > > >> > Thank you very much. > >> > > >> > Best regards, > >> > Arif > >> > > >> > > >> > On Tue, Oct 29, 2013 at 4:39 PM, Daniel Povey <dp...@gm...> > wrote: > >> >> > >> >> If you have only 1 hour of data, you will have to modify the > arguments > >> >> to the triphone-training script, i.e. the number of tree leaves and > >> >> number of Gaussians should be reduced. > >> >> Dan > >> >> > >> >> > >> >> On Tue, Oct 29, 2013 at 11:37 AM, Arif Khan <ife...@gm...> > >> >> wrote: > >> >> > Thanks Daniel for you quick answer. > >> >> > > >> >> > I have another question. I train a model using the WSJ S1 and S5 > >> >> > recipe, > >> >> > and > >> >> > got good results on monophone system than triphone. I have about > 1000 > >> >> > utterances, with length of ~1 hr, and about 300 vocabulary size. > >> >> > > >> >> > In theory, the triphone system should perform better than > monophone. > >> >> > So > >> >> > I > >> >> > don't know if something is wrong in the tree construction or any > >> >> > thing > >> >> > else > >> >> > could be fixed. > >> >> > > >> >> > Best regards, > >> >> > Arif > >> >> > > >> >> > > >> >> > On Tue, Oct 29, 2013 at 4:17 PM, Daniel Povey <dp...@gm...> > >> >> > wrote: > >> >> >> > >> >> >> Sorry, there is no code per se to get those kind of stats, but you > >> >> >> could perhaps convert the alignments into phone sequences and get > >> >> >> the > >> >> >> stats by hand (see ali-to-phones). > >> >> >> > >> >> >> Regarding the tree construction process, there is probably some > >> >> >> documentation on kaldi.sf.net; if there is a particular aspect of > >> >> >> that > >> >> >> that is unclear, please let us know; but otherwise, I doubt > anyone > >> >> >> has time to respond to your question right now. > >> >> >> > >> >> >> Dan > >> >> >> > >> >> >> > >> >> >> On Tue, Oct 29, 2013 at 10:42 AM, Arif Khan <ife...@gm... > > > >> >> >> wrote: > >> >> >> > Dear Kaldi authors, > >> >> >> > > >> >> >> > I want to do some analysis of the training data. Basically I > want > >> >> >> > to > >> >> >> > find > >> >> >> > out the number of phones (mono phone and tri phone) that > appeared > >> >> >> > in > >> >> >> > the > >> >> >> > training set. (relative frequency). Is there any module/script > >> >> >> > available > >> >> >> > for > >> >> >> > it. > >> >> >> > > >> >> >> > Also, I want to find out the tree construction process. I know > the > >> >> >> > basics > >> >> >> > from wsj/s5 recipe. But, some more details will be helpful. > >> >> >> > > >> >> >> > > >> >> >> > Best regards, > >> >> >> > Arif > >> >> >> > > >> >> >> > > >> >> >> > > >> >> >> > > >> >> >> > > ------------------------------------------------------------------------------ > >> >> >> > Android is increasing in popularity, but the open development > >> >> >> > platform > >> >> >> > that > >> >> >> > developers love is also attractive to malware creators. Download > >> >> >> > this > >> >> >> > white > >> >> >> > paper to learn more about secure code signing practices that can > >> >> >> > help > >> >> >> > keep > >> >> >> > Android apps secure. > >> >> >> > > >> >> >> > > >> >> >> > > >> >> >> > > http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk > >> >> >> > _______________________________________________ > >> >> >> > Kaldi-developers mailing list > >> >> >> > Kal...@li... > >> >> >> > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > >> >> >> > > >> >> > > >> >> > > >> > > >> > > > > > > |
|
From: Daniel P. <dp...@gm...> - 2013-10-29 16:41:10
|
There are no maximums, but generally it won't pay to make it more than 10,000 regardless how much data you have. Dan On Tue, Oct 29, 2013 at 12:35 PM, Arif Khan <ife...@gm...> wrote: > Thank you very much Daniel for such a detail answer. > > One more question in this regard, > > Do we have a maximum limit specially for No. of leafes, if we add more > corpus for training like WSJ than TIDIGITS or WSJ than Air traffic data. > > Best regards, > Arif > > > > On Tue, Oct 29, 2013 at 5:06 PM, Daniel Povey <dp...@gm...> wrote: >> >> The number of leaves should decrease as you decrease the data, but >> less than proportionally (e.g. 1/10 the data -> 1/4 the number of >> leaves). >> The number of Gaussians per leaf, which is the ratio of tot-num-gauss >> to num-leaves, should decrease as you decrease the data, e.g. 1/10 the >> data -> maybe 1/2 the average number of Gaussians per leaf. The total >> number of Gaussians should decrease in a >> slightly-less-than-proportional way as you decrease the amount of >> data. >> >> Dan >> >> >> On Tue, Oct 29, 2013 at 12:04 PM, Arif Khan <ife...@gm...> wrote: >> > Thanks Daniel. >> > >> > Do we have any fixed rule, or it is just trying different combinations >> > and >> > see the results. >> > Are the No. of leaves and No. of Gaussian dependent on each other OR >> > they >> > are independent means one can change either of them in any proportions. >> > >> > >> > >> > Thank you very much. >> > >> > Best regards, >> > Arif >> > >> > >> > On Tue, Oct 29, 2013 at 4:39 PM, Daniel Povey <dp...@gm...> wrote: >> >> >> >> If you have only 1 hour of data, you will have to modify the arguments >> >> to the triphone-training script, i.e. the number of tree leaves and >> >> number of Gaussians should be reduced. >> >> Dan >> >> >> >> >> >> On Tue, Oct 29, 2013 at 11:37 AM, Arif Khan <ife...@gm...> >> >> wrote: >> >> > Thanks Daniel for you quick answer. >> >> > >> >> > I have another question. I train a model using the WSJ S1 and S5 >> >> > recipe, >> >> > and >> >> > got good results on monophone system than triphone. I have about 1000 >> >> > utterances, with length of ~1 hr, and about 300 vocabulary size. >> >> > >> >> > In theory, the triphone system should perform better than monophone. >> >> > So >> >> > I >> >> > don't know if something is wrong in the tree construction or any >> >> > thing >> >> > else >> >> > could be fixed. >> >> > >> >> > Best regards, >> >> > Arif >> >> > >> >> > >> >> > On Tue, Oct 29, 2013 at 4:17 PM, Daniel Povey <dp...@gm...> >> >> > wrote: >> >> >> >> >> >> Sorry, there is no code per se to get those kind of stats, but you >> >> >> could perhaps convert the alignments into phone sequences and get >> >> >> the >> >> >> stats by hand (see ali-to-phones). >> >> >> >> >> >> Regarding the tree construction process, there is probably some >> >> >> documentation on kaldi.sf.net; if there is a particular aspect of >> >> >> that >> >> >> that is unclear, please let us know; but otherwise, I doubt anyone >> >> >> has time to respond to your question right now. >> >> >> >> >> >> Dan >> >> >> >> >> >> >> >> >> On Tue, Oct 29, 2013 at 10:42 AM, Arif Khan <ife...@gm...> >> >> >> wrote: >> >> >> > Dear Kaldi authors, >> >> >> > >> >> >> > I want to do some analysis of the training data. Basically I want >> >> >> > to >> >> >> > find >> >> >> > out the number of phones (mono phone and tri phone) that appeared >> >> >> > in >> >> >> > the >> >> >> > training set. (relative frequency). Is there any module/script >> >> >> > available >> >> >> > for >> >> >> > it. >> >> >> > >> >> >> > Also, I want to find out the tree construction process. I know the >> >> >> > basics >> >> >> > from wsj/s5 recipe. But, some more details will be helpful. >> >> >> > >> >> >> > >> >> >> > Best regards, >> >> >> > Arif >> >> >> > >> >> >> > >> >> >> > >> >> >> > >> >> >> > ------------------------------------------------------------------------------ >> >> >> > Android is increasing in popularity, but the open development >> >> >> > platform >> >> >> > that >> >> >> > developers love is also attractive to malware creators. Download >> >> >> > this >> >> >> > white >> >> >> > paper to learn more about secure code signing practices that can >> >> >> > help >> >> >> > keep >> >> >> > Android apps secure. >> >> >> > >> >> >> > >> >> >> > >> >> >> > http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk >> >> >> > _______________________________________________ >> >> >> > Kaldi-developers mailing list >> >> >> > Kal...@li... >> >> >> > https://lists.sourceforge.net/lists/listinfo/kaldi-developers >> >> >> > >> >> > >> >> > >> > >> > > > |
|
From: Arif K. <ife...@gm...> - 2013-10-29 16:35:18
|
Thank you very much Daniel for such a detail answer. One more question in this regard, Do we have a maximum limit specially for No. of leafes, if we add more corpus for training like WSJ than TIDIGITS or WSJ than Air traffic data. Best regards, Arif On Tue, Oct 29, 2013 at 5:06 PM, Daniel Povey <dp...@gm...> wrote: > The number of leaves should decrease as you decrease the data, but > less than proportionally (e.g. 1/10 the data -> 1/4 the number of > leaves). > The number of Gaussians per leaf, which is the ratio of tot-num-gauss > to num-leaves, should decrease as you decrease the data, e.g. 1/10 the > data -> maybe 1/2 the average number of Gaussians per leaf. The total > number of Gaussians should decrease in a > slightly-less-than-proportional way as you decrease the amount of > data. > > Dan > > > On Tue, Oct 29, 2013 at 12:04 PM, Arif Khan <ife...@gm...> wrote: > > Thanks Daniel. > > > > Do we have any fixed rule, or it is just trying different combinations > and > > see the results. > > Are the No. of leaves and No. of Gaussian dependent on each other OR they > > are independent means one can change either of them in any proportions. > > > > > > > > Thank you very much. > > > > Best regards, > > Arif > > > > > > On Tue, Oct 29, 2013 at 4:39 PM, Daniel Povey <dp...@gm...> wrote: > >> > >> If you have only 1 hour of data, you will have to modify the arguments > >> to the triphone-training script, i.e. the number of tree leaves and > >> number of Gaussians should be reduced. > >> Dan > >> > >> > >> On Tue, Oct 29, 2013 at 11:37 AM, Arif Khan <ife...@gm...> > wrote: > >> > Thanks Daniel for you quick answer. > >> > > >> > I have another question. I train a model using the WSJ S1 and S5 > recipe, > >> > and > >> > got good results on monophone system than triphone. I have about 1000 > >> > utterances, with length of ~1 hr, and about 300 vocabulary size. > >> > > >> > In theory, the triphone system should perform better than monophone. > So > >> > I > >> > don't know if something is wrong in the tree construction or any thing > >> > else > >> > could be fixed. > >> > > >> > Best regards, > >> > Arif > >> > > >> > > >> > On Tue, Oct 29, 2013 at 4:17 PM, Daniel Povey <dp...@gm...> > wrote: > >> >> > >> >> Sorry, there is no code per se to get those kind of stats, but you > >> >> could perhaps convert the alignments into phone sequences and get the > >> >> stats by hand (see ali-to-phones). > >> >> > >> >> Regarding the tree construction process, there is probably some > >> >> documentation on kaldi.sf.net; if there is a particular aspect of > that > >> >> that is unclear, please let us know; but otherwise, I doubt anyone > >> >> has time to respond to your question right now. > >> >> > >> >> Dan > >> >> > >> >> > >> >> On Tue, Oct 29, 2013 at 10:42 AM, Arif Khan <ife...@gm...> > >> >> wrote: > >> >> > Dear Kaldi authors, > >> >> > > >> >> > I want to do some analysis of the training data. Basically I want > to > >> >> > find > >> >> > out the number of phones (mono phone and tri phone) that appeared > in > >> >> > the > >> >> > training set. (relative frequency). Is there any module/script > >> >> > available > >> >> > for > >> >> > it. > >> >> > > >> >> > Also, I want to find out the tree construction process. I know the > >> >> > basics > >> >> > from wsj/s5 recipe. But, some more details will be helpful. > >> >> > > >> >> > > >> >> > Best regards, > >> >> > Arif > >> >> > > >> >> > > >> >> > > >> >> > > ------------------------------------------------------------------------------ > >> >> > Android is increasing in popularity, but the open development > >> >> > platform > >> >> > that > >> >> > developers love is also attractive to malware creators. Download > this > >> >> > white > >> >> > paper to learn more about secure code signing practices that can > help > >> >> > keep > >> >> > Android apps secure. > >> >> > > >> >> > > >> >> > > http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk > >> >> > _______________________________________________ > >> >> > Kaldi-developers mailing list > >> >> > Kal...@li... > >> >> > https://lists.sourceforge.net/lists/listinfo/kaldi-developers > >> >> > > >> > > >> > > > > > > |
23 messages has been excluded from this view by a project administrator.
