blocks|key|1049819|text|PEAR+Numbers_Words包可能是一个很好的开始：http://pear.php.net/package-info.php?package=Numbers_Words|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1049820|entityMap|0|LINK|mutability|MUTABLE|url|http://pear.php.net/package-info.php?package=Numbers_Words^0|5|D|U|1M|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]]|D|@$9|Q|A|R|1|S]]|E|$]]|$1|F|3|-4|5|6|7|T|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]]]

The PEAR <code>Numbers_Words</code> package is probably a good start: <a href="http://pear.php.net/package-info.php?package=Numbers_Words" rel="nofollow noreferrer">http://pear.php.net/package-info.php?package=Numbers_Words</a>

blocks|key|1389939|text|有很多页面讨论了从数字到单词的转换。对于相反的方向，没有那么多。我能找到的最好的东西就是Ask+Yahoo上的一些伪代码。关于一个很好的算法，请参阅http://answers.yahoo.com/question/index?qid=20090216103754AAONnDz：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1389940|1389941|嗯，总的来说，您正在做两件事:查找标记(可转换为数字的单词)和应用语法。简而言之，您正在为一种非常有限的语言构建一个解析器。|blockquote|1389942|1389943|您需要的令牌包括：|1389944|力量:千、百万、十亿|1389945|百:百|1389946|十:二十，三十..。九十|1389947|一，二，三，..。九,|1389948|特别:十，十一，十二，..。十九|1389949|(去掉任何“和”，因为它们没有意义。将连字符拆分为两个标记。即六十五应按“六十”“五”处理)|1389950|对字符串进行标记化后，从右向左移动。|1389951|1389952|1389953|从右侧抓取所有令牌，直到命中一个幂或整个字符串。|ordered-list-item|1389954|解析以下模式的停止点之后的令牌：|1389955|1389956|特别|1389957|十|1389958|单元|1389959|十个单元|1389960|单元百|1389961|单元百特别|1389962|单元一百一十|1389963|单位百个单位|1389964|单元110单元|1389965|(这假设此语法中不允许使用“1700”)|1389966|这将为您提供数字的最后三位数。|1389967|如果您在整个字符串处停止，则结束。|unordered-list-item|1389968|
|1389969|如果您在电源处停止，请从步骤1重新开始，直到您达到更高的幂或整个字符串。|1389970|1389971|entityMap|0|LINK|mutability|MUTABLE|url|http://answers.yahoo.com/question/index?qid=20090216103754AAONnDz^0|22|1T|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|28|8|@]|9|@$A|29|B|2A|1|2B]]|C|$]]|$1|D|3|-4|5|6|7|2C|8|@]|9|@]|C|$]]|$1|E|3|F|5|G|7|2D|8|@]|9|@]|C|$]]|$1|H|3|-4|5|6|7|2E|8|@]|9|@]|C|$]]|$1|I|3|J|5|6|7|2F|8|@]|9|@]|C|$]]|$1|K|3|L|5|6|7|2G|8|@]|9|@]|C|$]]|$1|M|3|N|5|6|7|2H|8|@]|9|@]|C|$]]|$1|O|3|P|5|6|7|2I|8|@]|9|@]|C|$]]|$1|Q|3|R|5|6|7|2J|8|@]|9|@]|C|$]]|$1|S|3|T|5|6|7|2K|8|@]|9|@]|C|$]]|$1|U|3|V|5|6|7|2L|8|@]|9|@]|C|$]]|$1|W|3|X|5|6|7|2M|8|@]|9|@]|C|$]]|$1|Y|3|-4|5|6|7|2N|8|@]|9|@]|C|$]]|$1|Z|3|-4|5|6|7|2O|8|@]|9|@]|C|$]]|$1|10|3|11|5|12|7|2P|8|@]|9|@]|C|$]]|$1|13|3|14|5|12|7|2Q|8|@]|9|@]|C|$]]|$1|15|3|-4|5|6|7|2R|8|@]|9|@]|C|$]]|$1|16|3|17|5|6|7|2S|8|@]|9|@]|C|$]]|$1|18|3|19|5|6|7|2T|8|@]|9|@]|C|$]]|$1|1A|3|1B|5|6|7|2U|8|@]|9|@]|C|$]]|$1|1C|3|1D|5|6|7|2V|8|@]|9|@]|C|$]]|$1|1E|3|1F|5|6|7|2W|8|@]|9|@]|C|$]]|$1|1G|3|1H|5|6|7|2X|8|@]|9|@]|C|$]]|$1|1I|3|1J|5|6|7|2Y|8|@]|9|@]|C|$]]|$1|1K|3|1L|5|6|7|2Z|8|@]|9|@]|C|$]]|$1|1M|3|1N|5|6|7|30|8|@]|9|@]|C|$]]|$1|1O|3|1P|5|6|7|31|8|@]|9|@]|C|$]]|$1|1Q|3|1R|5|6|7|32|8|@]|9|@]|C|$]]|$1|1S|3|1T|5|1U|7|33|8|@]|9|@]|C|$]]|$1|1V|3|1W|5|6|7|34|8|@]|9|@]|C|$]]|$1|1X|3|1Y|5|1U|7|35|8|@]|9|@]|C|$]]|$1|1Z|3|-4|5|6|7|36|8|@]|9|@]|C|$]]|$1|20|3|-4|5|6|7|37|8|@]|9|@]|C|$]]]|21|$22|$5|23|24|25|C|$26|27]]]]

There are lots of pages discussing the conversion from numbers to words. Not so many for the reverse direction. The best I could find was some pseudo-code on Ask Yahoo. See <a href="http://answers.yahoo.com/question/index?qid=20090216103754AAONnDz" rel="noreferrer">http://answers.yahoo.com/question/index?qid=20090216103754AAONnDz</a> for a nice algorithm:

<blockquote>
 Well, overall you are doing two things: Finding tokens (words that translates to numbers) and applying grammar. In short, you are building a parser for a very limited language.
 
 The tokens you would need are: 
 
 POWER: thousand, million, billion 
 HUNDRED: hundred 
 TEN: twenty, thirty... ninety 
 UNIT: one, two, three, ... nine, 
 SPECIAL: ten, eleven, twelve, ... nineteen
 
 (drop any "and"s as they are meaningless. Break hyphens into two tokens. That is sixty-five should be processed as "sixty" "five")
 
 Once you've tokenized your string, move from RIGHT TO LEFT.
 
 <ol>
 <li>Grab all the tokens from the RIGHT until you hit a POWER or the whole string.</li>
 <li>Parse the tokens after the stop point for these patterns:
 
 SPECIAL 
 TEN 
 UNIT 
 TEN UNIT 
 UNIT HUNDRED 
 UNIT HUNDRED SPECIAL 
 UNIT HUNDRED TEN 
 UNIT HUNDRED UNIT 
 UNIT HUNDRED TEN UNIT
 
 (This assumes that "seventeen hundred" is not allowed in this grammar)
 
 This gives you the last three digits of your number.</li>
 <li>If you stopped at the whole string you are done.</li>
 <li>If you stopped at a power, start again at step 1 until you reach a higher POWER or the whole string.</li>
 </ol>
</blockquote>

blocks|key|1049913|text|我没有对它进行过广泛的测试，我或多或少只是在上面工作，直到我在输出中看到了我所期望的，但它似乎是有效的，并且是从左到右解析的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1049914|<?php

$str+=+'twelve+billion+people+know+iPhone+has+two+hundred+and+thirty+thousand,+seven+hundred+and+eighty-three+apps+as+well+as+over+one+million+units+sold';

function+strlen_sort($a,+$b)
{
++++if(strlen($a)+>+strlen($b))
++++{
++++++++return+-1;
++++}
++++else+if(strlen($a)+<+strlen($b))
++++{
++++++++return+1;
++++}
++++return+0;
}

$keys+=+array(
++++'one'+=>+'1',+'two'+=>+'2',+'three'+=>+'3',+'four'+=>+'4',+'five'+=>+'5',+'six'+=>+'6',+'seven'+=>+'7',+'eight'+=>+'8',+'nine'+=>+'9',
++++'ten'+=>+'10',+'eleven'+=>+'11',+'twelve'+=>+'12',+'thirteen'+=>+'13',+'fourteen'+=>+'14',+'fifteen'+=>+'15',+'sixteen'+=>+'16',+'seventeen'+=>+'17',+'eighteen'+=>+'18',+'nineteen'+=>+'19',
++++'twenty'+=>+'20',+'thirty'+=>+'30',+'forty'+=>+'40',+'fifty'+=>+'50',+'sixty'+=>+'60',+'seventy'+=>+'70',+'eighty'+=>+'80',+'ninety'+=>+'90',
++++'hundred'+=>+'100',+'thousand'+=>+'1000',+'million'+=>+'1000000',+'billion'+=>+'1000000000'
);


preg_match_all('#((?:%5E%7Cand%7C,%7C+%7C-)*(\b'+.+implode('\b%7C\b',+array_keys($keys))+.+'\b))%2B#i',+$str,+$tokens);
//print_r($tokens);+exit;
$tokens+=+$tokens[0];
usort($tokens,+'strlen_sort');

foreach($tokens+as+$token)
{
++++$token+=+trim(strtolower($token));
++++preg_match_all('#(?:(?:and%7C,%7C+%7C-)*\b'+.+implode('\b%7C\b',+array_keys($keys))+.+'\b)%2B#',+$token,+$words);
++++$words+=+$words[0];
++++//print_r($words);
++++$num+=+'0';+$total+=+0;
++++foreach($words+as+$word)
++++{
++++++++$word+=+trim($word);
++++++++$val+=+$keys[$word];
++++++++//echo+"$val\n";
++++++++if(bccomp($val,+100)+==+-1)
++++++++{
++++++++++++$num+=+bcadd($num,+$val);
++++++++++++continue;
++++++++}
++++++++else+if(bccomp($val,+100)+==+0)
++++++++{
++++++++++++$num+=+bcmul($num,+$val);
++++++++++++continue;
++++++++}
++++++++$num+=+bcmul($num,+$val);
++++++++$total+=+bcadd($total,+$num);
++++++++$num+=+'0';
++++}
++++$total+=+bcadd($total,+$num);
++++echo+"$total:$token\n";
++++$str+=+preg_replace("#\b$token\b#i",+number_format($total),+$str);
}
echo+"\n$str\n";

?>|code-block|syntax|javascript|1049915|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

I haven't tested this too extensively, I more or less just worked on it until I saw what I expected in the output, but it seems to work, and parses from left-to-right.

<pre><code>&lt;?php

$str = 'twelve billion people know iPhone has two hundred and thirty thousand, seven hundred and eighty-three apps as well as over one million units sold';

function strlen_sort($a, $b)
{
 if(strlen($a) &gt; strlen($b))
 {
 return -1;
 }
 else if(strlen($a) &lt; strlen($b))
 {
 return 1;
 }
 return 0;
}

$keys = array(
 'one' =&gt; '1', 'two' =&gt; '2', 'three' =&gt; '3', 'four' =&gt; '4', 'five' =&gt; '5', 'six' =&gt; '6', 'seven' =&gt; '7', 'eight' =&gt; '8', 'nine' =&gt; '9',
 'ten' =&gt; '10', 'eleven' =&gt; '11', 'twelve' =&gt; '12', 'thirteen' =&gt; '13', 'fourteen' =&gt; '14', 'fifteen' =&gt; '15', 'sixteen' =&gt; '16', 'seventeen' =&gt; '17', 'eighteen' =&gt; '18', 'nineteen' =&gt; '19',
 'twenty' =&gt; '20', 'thirty' =&gt; '30', 'forty' =&gt; '40', 'fifty' =&gt; '50', 'sixty' =&gt; '60', 'seventy' =&gt; '70', 'eighty' =&gt; '80', 'ninety' =&gt; '90',
 'hundred' =&gt; '100', 'thousand' =&gt; '1000', 'million' =&gt; '1000000', 'billion' =&gt; '1000000000'
);


preg_match_all('#((?:^|and|,| |-)*(\b' . implode('\b|\b', array_keys($keys)) . '\b))+#i', $str, $tokens);
//print_r($tokens); exit;
$tokens = $tokens[0];
usort($tokens, 'strlen_sort');

foreach($tokens as $token)
{
 $token = trim(strtolower($token));
 preg_match_all('#(?:(?:and|,| |-)*\b' . implode('\b|\b', array_keys($keys)) . '\b)+#', $token, $words);
 $words = $words[0];
 //print_r($words);
 $num = '0'; $total = 0;
 foreach($words as $word)
 {
 $word = trim($word);
 $val = $keys[$word];
 //echo "$val\n";
 if(bccomp($val, 100) == -1)
 {
 $num = bcadd($num, $val);
 continue;
 }
 else if(bccomp($val, 100) == 0)
 {
 $num = bcmul($num, $val);
 continue;
 }
 $num = bcmul($num, $val);
 $total = bcadd($total, $num);
 $num = '0';
 }
 $total = bcadd($total, $num);
 echo "$total:$token\n";
 $str = preg_replace("#\b$token\b#i", number_format($total), $str);
}
echo "\n$str\n";

?&gt;
</code></pre>

blocks|key|1049961|text|老问题，但对于遇到这个问题的任何人，我今天必须写出一个解决方案。下面的方法与John+Kugelman描述的算法略有相似，但不是严格的语法；因此它将允许一些奇怪的排序，例如“1000.01亿”仍然会产生与“110万”(1,100,000)相同的结果。无效的位(例如拼写错误的数字)将被忽略，因此将无效字符串上的输出视为未定义。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1049962|根据用户132513对joebert回答的评论，我使用了Pear的Number_Words来生成测试系列。下面的代码在0到5,000,000之间的数字上获得100%25的分数，然后在0到10,000,000之间的100,000个数字的随机样本上获得100%25的分数(运行整个100亿系列需要很长时间)。|1049963|/**
+*+Convert+a+string+such+as+"one+hundred+thousand"+to+100000.00.
+*
+*+@param+string+$data+The+numeric+string.
+*
+*+@return+float+or+false+on+error
+*/
function+wordsToNumber($data)+{
++++//+Replace+all+number+words+with+an+equivalent+numeric+value
++++$data+=+strtr(
++++++++$data,
++++++++array(
++++++++++++'zero'++++++=>+'0',
++++++++++++'a'+++++++++=>+'1',
++++++++++++'one'+++++++=>+'1',
++++++++++++'two'+++++++=>+'2',
++++++++++++'three'+++++=>+'3',
++++++++++++'four'++++++=>+'4',
++++++++++++'five'++++++=>+'5',
++++++++++++'six'+++++++=>+'6',
++++++++++++'seven'+++++=>+'7',
++++++++++++'eight'+++++=>+'8',
++++++++++++'nine'++++++=>+'9',
++++++++++++'ten'+++++++=>+'10',
++++++++++++'eleven'++++=>+'11',
++++++++++++'twelve'++++=>+'12',
++++++++++++'thirteen'++=>+'13',
++++++++++++'fourteen'++=>+'14',
++++++++++++'fifteen'+++=>+'15',
++++++++++++'sixteen'+++=>+'16',
++++++++++++'seventeen'+=>+'17',
++++++++++++'eighteen'++=>+'18',
++++++++++++'nineteen'++=>+'19',
++++++++++++'twenty'++++=>+'20',
++++++++++++'thirty'++++=>+'30',
++++++++++++'forty'+++++=>+'40',
++++++++++++'fourty'++++=>+'40',+//+common+misspelling
++++++++++++'fifty'+++++=>+'50',
++++++++++++'sixty'+++++=>+'60',
++++++++++++'seventy'+++=>+'70',
++++++++++++'eighty'++++=>+'80',
++++++++++++'ninety'++++=>+'90',
++++++++++++'hundred'+++=>+'100',
++++++++++++'thousand'++=>+'1000',
++++++++++++'million'+++=>+'1000000',
++++++++++++'billion'+++=>+'1000000000',
++++++++++++'and'+++++++=>+'',
++++++++)
++++);

++++//+Coerce+all+tokens+to+numbers
++++$parts+=+array_map(
++++++++function+($val)+{
++++++++++++return+floatval($val);
++++++++},
++++++++preg_split('/[\s-]%2B/',+$data)
++++);

++++$stack+=+new+SplStack;+//+Current+work+stack
++++$sum+++=+0;+//+Running+total
++++$last++=+null;

++++foreach+($parts+as+$part)+{
++++++++if+(!$stack->isEmpty())+{
++++++++++++//+We're+part+way+through+a+phrase
++++++++++++if+($stack->top()+>+$part)+{
++++++++++++++++//+Decreasing+step,+e.g.+from+hundreds+to+ones
++++++++++++++++if+($last+>=+1000)+{
++++++++++++++++++++//+If+we+drop+from+more+than+1000+then+we've+finished+the+phrase
++++++++++++++++++++$sum+%2B=+$stack->pop();
++++++++++++++++++++//+This+is+the+first+element+of+a+new+phrase
++++++++++++++++++++$stack->push($part);
++++++++++++++++}+else+{
++++++++++++++++++++//+Drop+down+from+less+than+1000,+just+addition
++++++++++++++++++++//+e.g.+"seventy+one"+->+"70+1"+->+"70+%2B+1"
++++++++++++++++++++$stack->push($stack->pop()+%2B+$part);
++++++++++++++++}
++++++++++++}+else+{
++++++++++++++++//+Increasing+step,+e.g+ones+to+hundreds
++++++++++++++++$stack->push($stack->pop()+*+$part);
++++++++++++}
++++++++}+else+{
++++++++++++//+This+is+the+first+element+of+a+new+phrase
++++++++++++$stack->push($part);
++++++++}

++++++++//+Store+the+last+processed+part
++++++++$last+=+$part;
++++}

++++return+$sum+%2B+$stack->pop();
}|code-block|syntax|javascript|1049964|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|L|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|M|8|@]|9|@]|A|$G|H]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

Old question, but for anyone else coming across this I had to write up a solution to this today. The following takes a vaguely similar approach to the algorithm described by John Kugelman, but doesn't apply as strict a grammar; as such it will permit some weird orderings, e.g. "one hundred thousand and one million" will still produce the same as "one million and one hundred thousand" (1,100,000). Invalid bits (e.g. misspelled numbers) will be ignored, so the consider the output on invalid strings to be undefined.

Following user132513's comment on joebert's answer, I used Pear's Number_Words to generate test series. The following code scored 100% on numbers between 0 and 5,000,000 then 100% on a random sample of 100,000 numbers between 0 and 10,000,000 (it takes to long to run over the whole 10 billion series).

<pre><code>/**
 * Convert a string such as "one hundred thousand" to 100000.00.
 *
 * @param string $data The numeric string.
 *
 * @return float or false on error
 */
function wordsToNumber($data) {
 // Replace all number words with an equivalent numeric value
 $data = strtr(
 $data,
 array(
 'zero' =&gt; '0',
 'a' =&gt; '1',
 'one' =&gt; '1',
 'two' =&gt; '2',
 'three' =&gt; '3',
 'four' =&gt; '4',
 'five' =&gt; '5',
 'six' =&gt; '6',
 'seven' =&gt; '7',
 'eight' =&gt; '8',
 'nine' =&gt; '9',
 'ten' =&gt; '10',
 'eleven' =&gt; '11',
 'twelve' =&gt; '12',
 'thirteen' =&gt; '13',
 'fourteen' =&gt; '14',
 'fifteen' =&gt; '15',
 'sixteen' =&gt; '16',
 'seventeen' =&gt; '17',
 'eighteen' =&gt; '18',
 'nineteen' =&gt; '19',
 'twenty' =&gt; '20',
 'thirty' =&gt; '30',
 'forty' =&gt; '40',
 'fourty' =&gt; '40', // common misspelling
 'fifty' =&gt; '50',
 'sixty' =&gt; '60',
 'seventy' =&gt; '70',
 'eighty' =&gt; '80',
 'ninety' =&gt; '90',
 'hundred' =&gt; '100',
 'thousand' =&gt; '1000',
 'million' =&gt; '1000000',
 'billion' =&gt; '1000000000',
 'and' =&gt; '',
 )
 );

 // Coerce all tokens to numbers
 $parts = array_map(
 function ($val) {
 return floatval($val);
 },
 preg_split('/[\s-]+/', $data)
 );

 $stack = new SplStack; // Current work stack
 $sum = 0; // Running total
 $last = null;

 foreach ($parts as $part) {
 if (!$stack-&gt;isEmpty()) {
 // We're part way through a phrase
 if ($stack-&gt;top() &gt; $part) {
 // Decreasing step, e.g. from hundreds to ones
 if ($last &gt;= 1000) {
 // If we drop from more than 1000 then we've finished the phrase
 $sum += $stack-&gt;pop();
 // This is the first element of a new phrase
 $stack-&gt;push($part);
 } else {
 // Drop down from less than 1000, just addition
 // e.g. "seventy one" -&gt; "70 1" -&gt; "70 + 1"
 $stack-&gt;push($stack-&gt;pop() + $part);
 }
 } else {
 // Increasing step, e.g ones to hundreds
 $stack-&gt;push($stack-&gt;pop() * $part);
 }
 } else {
 // This is the first element of a new phrase
 $stack-&gt;push($part);
 }

 // Store the last processed part
 $last = $part;
 }

 return $sum + $stack-&gt;pop();
}
</code></pre>

blocks|key|1049999|text|在某种程度上更新了El+Yobo的答案，现在人们可以对(几乎)任何包含数字的字符串运行wordsToNumber函数。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1050000|https://github.com/thefish/words-to-number-converter|1050001|converter.php+-转换器本身|1050002|test.php+-使用各种字符串进行测试|1050003|UPD+22.10.2020:答案变得太大而无法维护。已将代码移至github。|1050004|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/users/217588/el-yobo|1^0|9|7|0|0|0|1G|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|F|3|G|5|6|7|12|8|@]|9|@]|C|$]]|$1|H|3|I|5|6|7|13|8|@]|9|@]|C|$]]|$1|J|3|K|5|6|7|14|8|@]|9|@]|C|$]]|$1|L|3|-4|5|6|7|15|8|@]|9|@]|C|$]]]|M|$N|$5|O|P|Q|C|$R|S]]|T|$5|O|P|Q|C|$R|E]]]]

Somewhat updated <a href="https://stackoverflow.com/users/217588/el-yobo">El Yobo</a>'s answer, now one can run wordsToNumber function over (almost) any string containing numerals.
<a href="https://github.com/thefish/words-to-number-converter" rel="nofollow noreferrer">https://github.com/thefish/words-to-number-converter</a>
converter.php - converter itself
test.php - test with various strings
UPD 22.10.2020: Answer become too big to maintain. moved code to github.

blocks|key|88421|text|我找到的最简单的方法是使用numfmt_parse|type|unstyled|depth|inlineStyleRanges|entityRanges|data|88422|$fmt+=+numfmt_create('en_US',+NumberFormatter::SPELLOUT);
echo+numfmt_parse($fmt,+'one+million+two+hundred+thirty-four+thousand+five+hundred+sixty-seven');|code-block|syntax|javascript|88423|(来源:多里安在的帖子)：|88424|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

The simplest way I've found is to use numfmt_parse:

<pre><code>$fmt = numfmt_create('en_US', NumberFormatter::SPELLOUT);
echo numfmt_parse($fmt, 'one million two hundred thirty-four thousand five hundred sixty-seven');
</code></pre>

(source; Dorian's post at <a href="https://stackoverflow.com/a/31588055/11827985">https://stackoverflow.com/a/31588055/11827985</a>):

I am trying to convert numerical values written as words into integers. For example,
"iPhone has two hundred and thirty thousand seven hundred and eighty three apps"
would become 
"iPhone as 230783 apps"

Before i start coding, I would like to know if any function / code exists for this conversion.

Converting words to numbers in PHP

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在尝试将写为单词的数值转换为整数。例如，"iPhone有230783个应用程序“将变成"iPhone as 230783个应用程序”。在开始编码之前，我想知道是否存在用于此转换的函数/代码。

问在PHP中将单词转换为数字
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问在PHP中将单词转换为数字EN